Publication:4418651
From MaRDI portal
zbMath1035.68052MaRDI QIDQ4418651
A. Pavan, Harry Buhrman, Lance J. Fortnow
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070212.htm
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Average-case intractability vs. worst-case intractability, Relations between average-case and worst-case complexity
