1090 search results - page 162 / 218 » The Equivalence between Biology and Computation |
110
click to vote
STOC
2007
ACM
16 years 5 days ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
100
click to vote
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
KDD
2009
ACM
15 years 6 months ago
2009
ACM
The relationship between financial incentives and performance, long of interest to social scientists, has gained new relevance with the advent of web-based “crowd-sourcing” mo...
106
click to vote
EUROCRYPT
2007
Springer
15 years 6 months ago
2007
Springer
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
108
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...