The operators min and max on the polynomial hierarchy
From MaRDI portal
Publication:5047162
DOI10.1007/BFB0023451zbMATH Open1499.68126MaRDI QIDQ5047162FDOQ5047162
Authors: Harald Hempel, Gerd Wechsung
Publication date: 9 November 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- The complexity of optimization problems
- The complexity of selecting maximal solutions
- Title not available (Why is that?)
- The complexity of computing the permanent
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- More complicated questions about maxima and minima, and some closures of NP
- On counting and approximation
- Title not available (Why is that?)
- A complexity theory for feasible closure properties
- Generalizations of Opt P to the polynomial hierarchy
- Some observations on the connection between counting and recursion
- THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
- Complexity classes of optimization functions
Cited In (7)
This page was built for publication: The operators min and max on the polynomial hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047162)