Non-restarting SAT solvers with simple preprocessing can efficiently simulate resolution
- Paul Beame
- Ashish Sabharwal
- 2014
- AAAI 2014
Publications
5 results for Paul Beame
Lower bounds for randomized read/write stream algorithms
- Paul Beame
- T.S. Jayram
- et al.
- 2007
- STOC 2007
Time-space tradeoffs for branching programs
- Paul Beame
- T.S. Jayram
- et al.
- 2001
- Journal of Computer and System Sciences
A time-space tradeoff for undirected graph traversal by walking automata
- Paul Beame
- Allan Borodin
- et al.
- 1999
- SIAM Journal on Computing
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
- Paul Beame
- Allan Borodin
- et al.
- 1996
- Information and Computation