Arithmetic theories for computational complexity problems

DOI10.1016/S0019-9958(86)80041-9zbMath0611.03018OpenAlexW1994197129MaRDI QIDQ3751567

Steve Homer, John H. Reif

Publication date: 1986

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(86)80041-9

zbMATH Keywords

polynomial time hierarchy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (1)

Index sets and presentations of complexity classes

This page was built for publication: Arithmetic theories for computational complexity problems