Publication:4267798
From MaRDI portal
DOI10.4086/cjtcs.1999.005zbMath0924.68097MaRDI QIDQ4267798
Moshe Y. Vardi, Sampath Kannan, Joan Feigenbaum, Mahesh Viswanathan
Publication date: 20 October 1999
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://www.cs.uchicago.edu/publications/cjtcs/articles/1999/5/contents.html
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Sequential Relational Decomposition, Model-checking hierarchical structures, On the OBDD size for graphs of bounded tree- and clique-width, BDDs -- design, analysis, complexity, and applications., Symbolic model checking for \(\mu\)-calculus requires exponential time, Processing succinct matrices and vectors, Symbolic graphs: Linear solutions to connectivity related problems, A parametric analysis of the state-explosion problem in model checking