111 search results - page 2 / 23 » Errors in Computational Complexity Proofs for Protocols |
ICNP
1998
IEEE
13 years 9 months ago
1998
IEEE
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequen...
STACS
2010
Springer
14 years 13 days ago
2010
Springer
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´ıˇcek and P...
ECCC
2010
13 years 4 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
FOCS
1991
IEEE
13 years 9 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...