6978 search results - page 155 / 1396 » On Proofs in System P |
159
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
123
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
189
click to vote
FROCOS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We discuss a pragmatic approach to integrate computer algebra into proof planning. It is based on the idea to separate computation and veri cation and can thereby exploit...
221
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
172
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...