4850 search results - page 166 / 970 » Proof and Computation in Geometry |
170
click to vote
RTA
2007
Springer
16 years 18 days ago
2007
Springer
We present a method of lifting to explicit substitution calculi some characterizations of the strongly normalizing terms of λ-calculus by means of intersection type systems. The m...
164
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...
178
click to vote
CG
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
190
click to vote
ICA3PP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. There is growing interest in large-scale resource sharing with emerging architectures such as cloud computing, where globally distributed and commoditized resources can b...
168
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...