STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The relative complexity of NP search problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A criterion for detecting unnecessary reductions in the construction of Groebner bases
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Intriactability of Read-Once Resolution
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Linear gaps between degrees for the polynomial calculus modulo distinct primes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast hierarchical clustering and other applications of dynamic closest pairs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast hierarchical clustering and other applications of dynamic closest pairs
Journal of Experimental Algorithmics (JEA)
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Information and Computation
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Homogenization and the Polynominal Calculus
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Exponential Lower Bound for Static Semi-algebraic Proofs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Random CNF's are Hard for the Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimality of size-width tradeoffs for resolution
Computational Complexity
Algebraic proof systems over formulas
Theoretical Computer Science - Logic and complexity in computer science
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
A combinatorial characterization of treelike resolution space
Information Processing Letters
Annals of Mathematics and Artificial Intelligence
Optimal length tree-like resolution refutations for 2SAT formulas
ACM Transactions on Computational Logic (TOCL)
Homogenization and the polynomial calculus
Computational Complexity
The resolution complexity of random graphk-colorability
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations
ACM Transactions on Computational Logic (TOCL)
Groebner bases computation in Boolean rings for symbolic model checking
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Phase transition of multivariate polynomial systems
Mathematical Structures in Computer Science
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Groebner bases computation in Boolean rings for symbolic model checking
MS '07 The 18th IASTED International Conference on Modelling and Simulation
The resolution complexity of random graph k-colorability
Discrete Applied Mathematics
A Gröbner basis approach to CNF-formulae preprocessing
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Phase transition of multivariate polynomial systems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Optimality of size-degree tradeoffs for polynomial calculus
ACM Transactions on Computational Logic (TOCL)
Automatizability and simple stochastic games
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Algebraic proofs over noncommutative formulas
Information and Computation
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Pool resolution and its relation to regular resolution and DPLL with clause learning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Input distance and lower bounds for propositional resolution proof length
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Lower bounds of static lovász-schrijver calculus proofs for tseitin tautologies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Proof complexity of non-classical logics
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Algebraic proofs over noncommutative formulas
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Preliminary report on input cover number as a metric for propositional resolution proofs
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
SIAM Journal on Computing
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Representing and solving finite-domain constraint problems using systems of polynomials
Annals of Mathematics and Artificial Intelligence
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards an understanding of polynomial calculus: new separations and lower bounds
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Implicit learning of common sense for reasoning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |