1322 search results - page 83 / 265 » Unsound Theorem Proving |
106
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
113
click to vote
CADE
2009
Springer
16 years 15 days ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
112
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...
184
click to vote
VSTTE
2012
Springer
13 years 7 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
94
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...