The complexity of processing hierarchical specifications

Authors:
Daniel J. Rosenkrantz;Harry B. Hunt, III
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1993

Citing 0
Cited 3

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

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of approximating pspace-complete problems for hierarchical specifications

Nordic Journal of Computing
Analysis Problems for Sequential Dynamical Systems and Communicating State Machines

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract