Towards Understanding and Harnessing the Potential of Clause Learning von Beame, P., Kautz, H., Sabharwal, A.

Volltext

Model checking large software specifications von Chan, W., Anderson, R.J., Beame, P., Burns, S., Modugno, F., Notkin, D., Reese, J.D.

Volltext

Heuristics for Fast Exact Model Counting von Sang, Tian, Beame, Paul, Kautz, Henry

Volltext

Optimal Bounds for the Predecessor Problem and Related Problems von Beame, Paul, Fich, Faith E.

Volltext

Optimizing symbolic model checking for statecharts von Chan, W., Anderson, R.J., Beame, P., Jones, D.H., Notkin, D., Warner, W.E.

Volltext

A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness von Beame, P., Pitassi, T., Segerlind, N., Wigderson, A.

Volltext

Memoization and DPLL: formula caching proof systems von Beame, P., Impagliazzo, R., Pitassi, T., Segerlind, N.

Volltext

Time-space trade-off lower bounds for randomized computation of decision problems von Beame, Paul, Saks, Michael, Sun, Xiaodong, Vee, Erik

Volltext

Improved depth lower bounds for small distance connectivity von Beame, P., Impagliazzo, R., Pitassi, T.

Volltext

The efficiency of resolution and Davis-Putnam procedures von BEAME, Paul, KARP, Richard, PITASSI, Toniann, SAKS, Michael

Volltext

Resolution complexity of independent sets in random graphs von Beame, P., Impagliazzo, R., Sabharwal, A.

Volltext bestellen

Making Branching Programs Oblivious Requires Superlogarithmic Overhead von Beame, P., Machmouchi, W.

Volltext

Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT von Beame, P., Impagliazzo, R., Srinivasan, S.

Volltext

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity von Beame, Paul, Pitassi, Toniann, Segerlind, Nathan

Volltext

A sharp threshold in proof complexity yields lower bounds for satisfiability search von Achlioptas, Dimitris, Beame, Paul, Molloy, Michael

Volltext

The resolution complexity of random graph k-colorability von Beame, Paul, Culberson, Joseph, Mitchell, David, Moore, Cristopher

Volltext

The Relative Complexity of NP Search Problems von Beame, Paul, Cook, Stephen, Edmonds, Jeff, Impagliazzo, Russell, Pitassi, Toniann

Volltext

Time–Space Tradeoffs for Branching Programs von Beame, Paul, Jayram, T.S., Saks, Michael

Volltext

Parallel algorithms for arrangements von Anderson, R., Beanie, P., Brisson, E.

Volltext

Log depth circuits for division and related problems von BEAME, P. W, COOK, S. A, HOOVER, H. J

Volltext