Sciweavers

4 search results - page 1 / 1
» Hard examples for bounded depth frege
Sort
View
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
14 years 2 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
AML
2011
204views Mathematics» more  AML 2011»
13 years 4 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
AAAI
2008
14 years 3 days ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams