Instance Compression for the Polynomial Hierarchy and beyond
DOI10.1007/978-3-642-33293-7_13zbMath1375.68057OpenAlexW1504894251MaRDI QIDQ4899247
Rahul Santhanam, Chiranjit Chakraborty
Publication date: 7 January 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17928375/Chakraborty_Santhanam_2012_Instance_Compression_for_the_Polynomial_Hierachy_and_Beyond.pdf
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
This page was built for publication: Instance Compression for the Polynomial Hierarchy and beyond
