Stefan S. Dantchev

Abdul Ghani

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2018

Resolution and the binary encoding of combinatorial principles.

[BibT_eX]

[DOI]

Nicola Galesi

Electron. Colloquium Comput. Complex., 2018

The Riis Complexity Gap for QBF Resolution.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

2016

Simplicial Complex Entropy.

[BibT_eX]

[DOI]

Ioannis P. Ivrissimtzis

Proceedings of the Mathematical Methods for Curves and Surfaces, 2016

2014

Relativization makes contradictions harder for Resolution.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

2013

Relativisation makes contradictions harder for Resolution

[BibT_eX]

[DOI]

CoRR, 2013

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.

[BibT_eX]

[DOI]

Comput. Complex., 2013

Parameterized Resolution with Bounded Conjunction.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Cutting Planes and the Parameter Cutwidth.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Efficient construction of the Čech complex.

[BibT_eX]

[DOI]

Ioannis P. Ivrissimtzis

Comput. Graph., 2012

The limits of tractability in Resolution-based propositional proof systems.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2012

2011

Sublinear-time algorithms for tournament graphs.

[BibT_eX]

[DOI]

Tom Friedetzky

Lars Nagel

J. Comb. Optim., 2011

Dynamic Neighbourhood Cellular Automata.

[BibT_eX]

[DOI]

Comput. J., 2011

Parameterized Proof Complexity.

[BibT_eX]

[DOI]

Stefan Szeider

Comput. Complex., 2011

2009

Tight rank lower bounds for the Sherali-Adams proof system.

[BibT_eX]

[DOI]

Mark Nicholas Charles Rhodes

Theor. Comput. Sci., 2009

Editorial.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

2008

Preface.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

2007

Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model.

[BibT_eX]

[DOI]

Image Vis. Comput., 2007

Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.

[BibT_eX]

[DOI]

Stefan Szeider

Electron. Colloquium Comput. Complex., 2007

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Florent R. Madelaine

Proceedings of the Computer Science, 2006

Relativisation Provides Natural Separations for Resolution-Based Proof Systems.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

On the Complexity of the Sperner Lemma.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

On the computational limits of infinite satisfaction.

[BibT_eX]

[DOI]

Frank D. Valencia

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 12th International Conference, 2005

2003

On Relativisation and Complexity Gap.

[BibT_eX]

[DOI]

Søren Riis

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Improved sorting-based procedure for integer programming.

[BibT_eX]

[DOI]

Math. Program., 2002

An alternative to Ben-Or's lower bound for the knapsack problem complexity.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2002

Resolution Width-Size Trade-offs for the Pigeon-Hole Principle.

[BibT_eX]

[DOI]

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

"Planar" Tautologies Hard for Resolution.

[BibT_eX]

[DOI]

Søren Riis

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Tree Resolution Proofs of the Weak Pigeon-Hole Principle.

[BibT_eX]

[DOI]

Søren Riis

Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000

On the Algebraic Complexity of Integer Programming

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

1998

Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

1997

Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model.

[BibT_eX]

[DOI]