Items where Author / Artist / Editor is "Dantchev, Stefan"

See full list of headings
Export as [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 6.

Article

Dantchev, Stefan and Martin, Barnaby (2013) Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity, 22 (1) . pp. 191-213. ISSN 1016-3328 (doi:10.1007/s00037-012-0049-1)

Dantchev, Stefan and Martin, Barnaby (2011) Cutting planes and the parameter cutwidth. Theory of Computing Systems, 51 (1) . pp. 50-64. ISSN 1432-4350 (doi:10.1007/s00224-011-9373-0)

Dantchev, Stefan and Martin, Barnaby (2011) The limits of tractability in resolution-based propositional proof systems. Annals of Pure and Applied Logic, 163 (6) . pp. 656-668. ISSN 0168-0072 (doi:10.1016/j.apal.2011.11.001)

Dantchev, Stefan, Martin, Barnaby and Szeider, Stefan (2011) Parameterized proof complexity. Computational Complexity, 20 (1) . pp. 51-85. ISSN 1016-3328 (doi:10.1007/s00037-010-0001-1)

Dantchev, Stefan, Martin, Barnaby and Rhodes, Mark (2009) Tight rank lower bounds for the Sherali–Adams proof system. Theoretical Computer Science, 410 (21-23) . pp. 2054-2063. ISSN 0304-3975 (doi:10.1016/j.tcs.2009.01.002)

Conference or Workshop Item

Dantchev, Stefan and Martin, Barnaby (2010) The limits of tractability in resolution-based propositional proof systems. In: 6th International Conference on Computability in Europe: Programs, Proofs, Processes (CIE 2010), 30 June - 4 July 2010, Portugal. .

This list was generated on Sat Dec 14 05:26:35 2019 GMT.