Publication:3811710

zbMath0661.68046MaRDI QIDQ3811710

Juris Hartmanis

Publication date: 1987

zbMATH Keywords

survey; polynomial time hierarchy; sparse NP-complete sets

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D15: Complexity of computation (including implicit computational complexity)

Related Items

New developments in structural complexity theory