The complexity of approximating PSPACE-complete problems for hierarchical specifications
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Approximating linear programming is log-space complete for PInformation Processing Letters, 1991
- Hierarchical planarity testing algorithmsJournal of the ACM, 1989
- Fast parallel approximations of the maximum weighted cut problem through derandomizationPublished by Springer Nature ,1989
- The parallel complexity of the subgraph connectivity problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Efficient Solution of Connectivity Problems on Hierarchically Defined GraphsSIAM Journal on Computing, 1988
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphsJournal of Algorithms, 1987
- Efficient solutions of hierarchical systems of linear equationsComputing, 1987
- Exploiting hierarchy in VLSI designPublished by Springer Nature ,1986
- A fast parallel algorithm for the maximal independent set problemJournal of the ACM, 1985
- Succinct representations of graphsInformation and Control, 1983