| Publication | Date of Publication | Type |
|---|
Proof complexity and the binary encoding of combinatorial principles
SIAM Journal on Computing | 2024-06-27 | Paper |
Depth lower bounds in stabbing planes for combinatorial principles
| 2024-04-23 | Paper |
Resolution and the binary encoding of combinatorial principles
| 2022-07-27 | Paper |
Simplicial complex entropy
| 2018-01-19 | Paper |
Relativization makes contradictions harder for resolution
Annals of Pure and Applied Logic | 2013-12-16 | Paper |
Parameterized resolution with bounded conjunction
Computer Science – Theory and Applications | 2013-06-14 | Paper |
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Computational Complexity | 2013-04-11 | Paper |
Cutting planes and the parameter cutwidth
Theory of Computing Systems | 2012-12-07 | Paper |
Parameterized proof complexity
Computational Complexity | 2012-09-21 | Paper |
A modification of A. Mullin's inequality.
Notes on Number Theory and Discrete Mathematics | 2012-09-10 | Paper |
The limits of tractability in resolution-based propositional proof systems
Annals of Pure and Applied Logic | 2012-03-29 | Paper |
Sublinear-time algorithms for tournament graphs
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
The limits of tractability in resolution-based propositional proof systems
Programs, Proofs, Processes | 2010-07-29 | Paper |
Cutting planes and the parameter cutwidth
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Sublinear-Time Algorithms for Tournament Graphs
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Tight rank lower bounds for the Sherali-Adams proof system
Theoretical Computer Science | 2009-05-28 | Paper |
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
| 2009-01-05 | Paper |
A generalized net model of users' traffic in telecommunication system with blocking and heterogeneous subscribers
| 2008-10-17 | Paper |
Generalized net realisation of Kolmogorov's algorithm
| 2008-09-09 | Paper |
Integer programming in an algebraic computation model
| 2008-02-22 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Relativisation Provides Natural Separations for Resolution-Based Proof Systems
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Logical Approaches to Computational Barriers
Lecture Notes in Computer Science | 2007-04-30 | Paper |
scientific article; zbMATH DE number 5143227 (Why is no real title available?)
| 2007-04-16 | Paper |
Discrete Geometry for Computer Imagery
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Improved sorting-based procedure for integer programming
Mathematical Programming. Series A. Series B | 2003-01-20 | Paper |
scientific article; zbMATH DE number 1759478 (Why is no real title available?)
| 2002-11-28 | Paper |
An alternative to Ben-Or's lower bound for the knapsack problem complexity
Applied Mathematics Letters | 2002-08-15 | Paper |
Tight complexity bounds for the two-dimensional real knapsack problem
Calcolo | 2000-10-22 | Paper |
scientific article; zbMATH DE number 1391709 (Why is no real title available?)
| 2000-01-20 | Paper |
Real data-integer solution problems within the Blum-Shub-Smale computational model
Journal of Complexity | 1997-11-20 | Paper |
scientific article; zbMATH DE number 859816 (Why is no real title available?)
| 1996-07-17 | Paper |
