The Complexity of Processing Hierarchical Specifications

DOI10.1137/0222042MaRDI QIDQ4202216zbMATH OpenOpenAlexFDO

Authors Daniel J. Rosenkrantz, H. B. III Hunt

Publication date 1 September 1993

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222042

zbMATH Keywords

circuit simulationhierarchical specification

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4153916
• scientific article; zbMATH DE number 1113995
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• scientific article; zbMATH DE number 751134
• The complexity of approximating \(\mathrm{PSPACE}\)-complete problems for hierarchical specifications

Cited in

(3)

• Associative hierarchy in complex processes
• scientific article; zbMATH DE number 4153916 (Why is no real title available?)
• scientific article; zbMATH DE number 751134 (Why is no real title available?)

This page was built for publication: The Complexity of Processing Hierarchical Specifications

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