Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)

DOI10.1145/195058.195233MaRDI QIDQ2817638zbMATH OpenOpenAlexFDO

Authors R. E. Stearns, V. Radhakrishnan, Madhav V. Marathe, H. B. III Hunt

Publication date 1 September 2016

Published in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/195058.195233

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
• scientific article; zbMATH DE number 1335885
• The complexity of approximating \(\mathrm{PSPACE}\)-complete problems for hierarchical specifications
• scientific article; zbMATH DE number 751134
• scientific article; zbMATH DE number 1113995

Cited in

(6)

• Hierarchically specified unit disk graphs
• A nonapproximability result for finite function generation
• Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
• scientific article; zbMATH DE number 1113995 (Why is no real title available?)
• scientific article; zbMATH DE number 751134 (Why is no real title available?)
• Succinct Permanent Is NEXP-Hard with Many Hard Instances

This page was built for publication: Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817638)