Inseparability and Strong Hypotheses for Disjoint NP Pairs.
From MaRDI portal
Publication:3113766
DOI10.4230/LIPIcs.STACS.2010.2471zbMath1230.68079OpenAlexW2244043162MaRDI QIDQ3113766
Jack H. Lutz, Elvira Mayordomo, Lance J. Fortnow
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_092c.html
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
This page was built for publication: Inseparability and Strong Hypotheses for Disjoint NP Pairs.