Sciweavers

6978 search results - page 180 / 1396
» On Proofs in System P
Sort
View
MEMBRANE
2009
Springer
16 years 1 months ago
Conformon P Systems and Topology of Information Flow
would be an abstract answer (because it would not immediately link a formal model with the biological reality that inspired it or with possible implementations) from the other hand...
Pierluigi Frisco
FOCS
2003
IEEE
15 years 11 months ago
Lower Bounds for Non-Black-Box Zero Knowledge
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
Boaz Barak, Yehuda Lindell, Salil P. Vadhan
CORR
2010
Springer
89views Education» more  CORR 2010»
15 years 6 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty
ECCC
2006
96views more  ECCC 2006»
15 years 6 months ago
An Unconditional Study of Computational Zero Knowledge
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...
Salil P. Vadhan
COMBINATORICS
2000
75views more  COMBINATORICS 2000»
15 years 6 months ago
Franklin's Argument Proves an Identity of Zagier
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
Robin J. Chapman