- Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity
- Low Overhead Parallel Schedules for Task. Graphs* (Extended Abstract)
- Proof Complexity Lecturer: Paul Beame
- Improving Efficiency of Symbolic Model Checking for StateBased System Requirements
- Proof complexity, the study of the lengths of proofs in propositional logic, is an area of study that is fundamentally connected both to major open questions of
- An Exponential Separation between the Matching Principle and
- THE EFFICIENCY OF RESOLUTION AND DAVIS-PUTNAM PROCEDURES
- Limits on the Power of Concurrent-Write Parallel Machines Dept. of Computer Science
- The Relative Complexity of NP Search Problems Paul Beame 3
- Time-Space Tradeo s for Branching Programs Paul Beame y
- Separating the Power of EREW and CREW PRAMs with Small Communication Width \Lambda
- A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness
- Formula Caching in DPLL University of Washington
- A General Sequential Time-Space Tradeoff for Finding Unique Elements
- A TIMESPACE TRADEOFF FOR UNDIRECTED GRAPH TRAVERSAL BY WALKING AUTOMATA #
- TimeSpace Tradeoffs, Multiparty Communication Complexity, and NearestNeighbor Problems
- LOG DEPTH CIRCUITS FOR DIVISION AND RELATED PROBLEMS+
- Understanding the Power of Clause Learning Paul Beame Henry Kautz Ashish Sabharwal
- Randomized versus Nondeterministic Communication Complexity Department of Computer Science and Engineering, FR-35
- Hardness Amplification in Proof Complexity Computer Science &
- Multiparty Communication Complexity and Threshold Circuit Size Computer Science and Engineering
- On the Value of Multiple Read/Write Streams for Approximating Frequency Computer Science and Engineering
- A STRONG DIRECT PRODUCT THEOREM FOR CORRUPTION AND THE
- comput. complex. 0 (0000), 1 54 1016-3328/00/00000154 $ 1.50+0.20/0
- Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity
- A Sharp Threshold in Proof Complexity Dimitris Achlioptas
- Comput. complex. 7 1998, 325 345 1016-3328 98 040325 21 $ 1.50+0.20 0
- Algorithmica (1996) 15: 104125 Algorithmica
- Optimizing Symbolic Model Checking for Statecharts
- Model Checking Large Software Specifications Pdchard J. Anderson* Paul Beame Steve Burns William Chan
- TimeSpace Tradeoffs for Undirected Graph Traversal
- Exponential Lower Bounds for the Pigeonhole Principle * Paul Beame t Russell Impagliazzo Jan Kraji6ek
- Lower Bounds for Randomized Read/Write Stream Computer Science and
- More on the Relative Strength of Counting Principles Paul Beame Sren Riis
- Propositional Proof Complexity: Past, Present, Paul Beame and Toniann Pitassi
- THEORY OF COMPUTING, Volume 6 (2010), pp. 201225 www.theoryofcomputing.org
- Optimal Bounds for Decision Problems on the CRCW PRAM
- EXPONENTIAL LOWER BOUNDS FOR THE PIGEONHOLE PRINCIPLE
- Separating the Power of EREW and CREW PRAMs with Small Communication Width 3
- Parallel Processing Letters fl World Scientific Publishing Company
- Limits on the Power of ConcurrentWrite Parallel Machines Dept. of Computer Science
- Communication--Space Tradeo#s for Unrestricted Protocols #
- Exponential Bounds for DPLL Below the Satisfiability Threshold Dimitris Achlioptas # Paul Beame + Michael Molloy #
- Lower Bounds for Recognizing Small Cliques
- Lower bounds on Hilbert's Nullstellensatz and propositional proofs
- Resolution Complexity of Independent Sets in Random Graphs Paul Beame* Russell Impagliazzot
- information and computation 130, 101 129 (1996) Time-Space Tradeoffs for Undirected Graph
- Lower bounds on Hilbert's Nullstellensatz and propositional proofs
- The Resolution Complexity of Random Graph kColorability Paul Beame #
- On the Complexity of Unsatisfiability Proofsfor Randomk=CNF PaulBeame* RichardKarpf ToniannPitas& IvlichaelSal+&
- Time-Space Tradeoffs for Branching Programs Computer Science and Engineering
- Memoization and DPLL: Formula Caching Proof Systems Paul Beame
- Boundeddepth Frege lower bounds for weaker pigeonhole principles Josh BureshOppenheim
- Combining Component Caching and Clause Learning for Effective Model Counting
- Timespace tradeoff lower bounds for randomized computation of decision problems
- Parallel Algorithms for Arrangements Richard Anderson* Paul Beame*
- Improved Depth Lower Bounds for Small Distance Connectivity Paul Beame \Lambda
- Simplified and Improved Resolution Lower Bounds Paul Beame \Lambda
- Model Checking Large Software Specifications William Chan Richard J. Anderson Paul Beame Steve Burns
- A sharp threshold in proof complexity yields lower bounds for satisfiability search
- Distributed Computing on Transitive Networks: The Paul W. Beame + Hans L. Bodlaender #
- Combining Constraint Solving and Symbolic Model Checking for a Class of Systems with
- A Switching Lemma Primer # University of Toronto +
- The Relative Complexity of NP Search Problems PAUL BEAME* STEPHEN COOKT JEFF EDMONDS$
- Optimal Bounds for Decision Problems on the CRCW PRAM (Extended Abstract)
- Decoupling Synchronization from Logic for Efficient Symbolic Model Checking of Statecharts
- A General Sequential TimeSpace Tradeo# for Finding Unique Elements
- Optimal Bounds for the Predecessor Problem and Related Problems Paul Beame
- Optimal Bounds for the Predecessor Problem Paul Beame*
- The Complexity of Computing Symmetric Functions Using Threshold Circuits 1
- Approximating AC0 by Small Height Decision Trees and a
- A Note on Neciporuk's Method for Nondeterministic Branching Programs
- MULTIPARTY COMMUNICATION COMPLEXITY AND THRESHOLD CIRCUIT SIZE OF AC0
- The Value of Multiple Read/Write Streams for Approximating Frequency Moments
- Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space
- Making Branching Programs Oblivious Requires Superlogarithmic Overhead Computer Science and Engineering
