179 search results - page 13 / 36 » eccc 2010 |
ECCC
2010
13 years 7 months ago
2010
An arithmetic read-once formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+,
ECCC
2010
13 years 4 months ago
2010
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj
ECCC
2006
13 years 7 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
ECCC
2007
13 years 7 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
ECCC
2007
13 years 7 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...