Hard Instances of Algorithms and Proof Systems
From MaRDI portal
Publication:5891700
DOI10.1007/978-3-642-30870-3_13zbMath1357.68080OpenAlexW1515178045MaRDI QIDQ5891700
Yijia Chen, Jörg Flum, Moritz Müller
Publication date: 14 August 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://ddd.uab.cat/record/77023
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Hard Instances of Algorithms and Proof Systems
