Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



LATEST > REPORTS:
RSS-Feedprevious PreviousNext next

TR94-018 | 12th December 1994
Jan Krajicek, Pavel Pudlak, Alan Woods

An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle

We prove lower bounds of the form $exp\left(n^{\epsilon_d}\right),$
$\epsilon_d>0,$ on the length of proofs of an explicit sequence of
tautologies, based on the Pigeonhole Principle, in proof systems
using formulas of depth $d,$ for any constant $d.$ This is the
largest lower bound for the strongest proof system, for which ... more >>>


TR94-025 | 12th December 1994
David P. Dobkin, Dimitrios Gunopulos

Computing the Maximum Bichromatic Discrepancy with applications to Computer Graphics and Machine Learning


Computing the maximum bichromatic discrepancy is an interesting
theoretical problem with important applications in computational
learning theory, computational geometry and computer graphics.
In this paper we give algorithms to compute the maximum
bichromatic discrepancy for simple geometric ranges, including
rectangles and halfspaces.
In addition, we give ... more >>>


TR94-024 | 12th December 1994
Marek Karpinski, Angus Macintyre

Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks

We introduce a new method for proving explicit upper bounds on the VC
Dimension of general functional basis networks, and prove as an
application, for the first time, the VC Dimension of analog neural
networks with the sigmoid activation function $\sigma(y)=1/1+e^{-y}$
to ... more >>>



previous PreviousNext next


ISSN 1433-8092 | Imprint