345 search results - page 7 / 69 » Computer-Assisted Simulation Proofs |
JSCIC
2010
14 years 4 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...
109
click to vote
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...