Dr Stefan Dantchev s.s.dantchev@durham.ac.uk
Assistant Professor
Parameterized Proof Complexity
Dantchev, Stefan; Martin, Barnaby; Szeider, Stefan
Authors
Dr Barnaby Martin barnaby.d.martin@durham.ac.uk
Associate Professor
Stefan Szeider
Citation
Dantchev, S., Martin, B., & Szeider, S. (2011). Parameterized Proof Complexity. Computational Complexity, 20(1), 51-85. https://doi.org/10.1007/s00037-010-0001-1
| Journal Article Type | Article |
|---|---|
| Publication Date | 2011 |
| Deposit Date | Oct 6, 2010 |
| Journal | Computational Complexity |
| Print ISSN | 1016-3328 |
| Electronic ISSN | 1420-8954 |
| Publisher | Springer |
| Peer Reviewed | Peer Reviewed |
| Volume | 20 |
| Issue | 1 |
| Pages | 51-85 |
| DOI | https://doi.org/10.1007/s00037-010-0001-1 |
You might also like
Combinatorial Axiomatisation of Edge-weighted PageRank
(2016)
Journal Article
Relativization makes contradictions harder for Resolution
(2013)
Journal Article
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
(2012)
Journal Article
Cutting Planes and the Parameter Cutwidth
(2012)
Journal Article
The limits of tractability in Resolution-based propositional proof systems
(2011)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search