Searching for "On Proving Lower Bounds for Circuit Size." – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Characterizing Linear Size Circuits in Terms of Privacy
- … Introduction Proving lower bounds on circuit size is one of the central goals of complexity theory. While…
- Cited by 12 (5 self) – Add To MetaCart
-
On submodular complexity measures
- … bound for the circuit size of f which is tight up to à polynomial. Then the burden of proving lower…
- Cited by 4 (0 self) – Add To MetaCart
-
A Fundamental Problem of Mathematical Logic
- …, complementing the program of Boolean complexity to prove lower bounds to circuit-size for various restricted…
- Cited by 6 (2 self) – Add To MetaCart
-
Deterministic polynomial identity testing in non commutative models
- … connections between deterministic polynomial identity testing and proving lower bounds for circuit size [2…
- Cited by 11 (6 self) – Add To MetaCart
-
Circuit Lower Bounds and Linear Codes
- … Introduction The problem of proving nontrivial lower bounds on the size of circuits is one of the most…
- Add To MetaCart
-
Complexity Theoretic Aspects of some Cryptographic Functions
- … arguments), there is amazingly small progress in proving lower bounds on the circuit size for concrete…
- Cited by 1 (1 self) – Add To MetaCart
-
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
- … calculus where we would like to prove lower bounds on the size of proofs in some natural proof systems. We…
- Cited by 57 (20 self) – Add To MetaCart
-
Lower bounds on Hilbert's Nullstellensatz and propositional proofs
- … like to prove lower bounds on the size of proofs in some natural proof systems. We can think…
- Add To MetaCart
-
SUBQUADRATIC SIMULATIONS OF BALANCED FORMULAE BY BRANCHING PROGRAMS *
- … bound applies to functions with linear circuit size. See also [B2] and [BT] for lower bounds…
- Add To MetaCart
Showing 1 through 9.
