523 search results - page 60 / 105 » On the Power of Quantum Proofs |
119
click to vote
STOC
2006
ACM
16 years 4 days ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
106
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problem...
105
click to vote
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
102
click to vote
IANDC
2010
14 years 10 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
ECOOP
2006
Springer
15 years 3 months ago
2006
Springer
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...