10715 search results - page 29 / 2143 » Proofs from Tests |
127
Voted
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
142
Voted
ECCC
2010
14 years 10 months ago
2010
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
124
Voted
ICFP
2007
ACM
16 years 3 months ago
2007
ACM
It is rare to give a semantic definition of a full-scale programming language, despite the many potential benefits. Partly this is because the available metalanguages for expressi...
121
click to vote
EUROCRYPT
2008
Springer
15 years 5 months ago
2008
Springer
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
134
click to vote
FORMATS
2008
Springer
15 years 5 months ago
2008
Springer
Verification of partially synchronous distributed systems is difficult because of inherent concurrency and the potentially large state space of the channels. This paper identifies ...