On Sparse Complete Sets

DOI10.1002/MALQ.19850311411zbMath0553.03027OpenAlexW2082437947MaRDI QIDQ3346297

Gerd Wechsung

Publication date: 1985

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19850311411

zbMATH Keywords

reducibilityNP-completenesssparsityNPcoNPrandom polynomial time class

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

This page was built for publication: On Sparse Complete Sets