Publication:3113769

DOI10.4230/LIPIcs.STACS.2010.2462zbMath1230.68090MaRDI QIDQ3113769

A. Pavan, Xiaoyang Gu, John M. Hitchcock

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_3034.html

zbMATH Keywords

computational complexity; NP-completeness

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)