3228 search results - page 290 / 646 » Computationally Sound Proofs |
139
click to vote
JACM
2002
15 years 4 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
175
click to vote
CC
2008
Springer
15 years 4 months ago
2008
Springer
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
143
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
137
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. We show how to extract existential witnesses from classical proofs using Krivine’s classical realizability—where classical proofs are interpreted as λ-terms with the...
276
click to vote
Book
"Delay effects, such as phasing, flanging, chorus, and artificial reverberation, provide an excellent starting point for the subject of digital waveguide modeling because both...