6978 search results - page 213 / 1396 » On Proofs in System P |
170
click to vote
MOZ
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Recently, development of peer-to-peer (P2P) applications has been giving a paramount attention mostly due to their attractive features such as decentralization and self-o...
179
click to vote
ECCC
2007
15 years 6 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...
159
click to vote
FROCOS
2007
Springer
16 years 22 days ago
2007
Springer
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
177
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
145
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...