4850 search results - page 172 / 970 » Proof and Computation in Geometry |
158
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
139
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
171
click to vote
JSCIC
2010
15 years 1 months ago
2010
While second order methods for computational simulations of fluid flow provide the basis of widely used commercial software, there is a need for higher order methods for more accur...
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...
183
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...