Model-checking hierarchical structures (Q414908): Difference between revisions

@@ Property / cites work @@
+A very hard log-space counting class
@@ Property / cites work: A very hard log-space counting class / rank @@
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+On uniformity within \(NC^ 1\)
@@ Property / cites work: On uniformity within \(NC^ 1\) / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct circuit representations and leaf language classes are basically the same concept
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform method for proving lower bounds on the computational complexity of logical theories
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+The first order properties of products of algebraic systems
+Normal rank
@@ Property / cites work @@
+Q4267798
@@ Property / cites work: Q4267798 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+The complexity of first-order and monadic second-order logic revisited
+Normal rank
@@ Property / cites work @@
+Q3666827
@@ Property / cites work: Q3666827 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representations of graphs
@@ Property / cites work: Succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Existential second-order logic over graphs
@@ Property / cites work: Existential second-order logic over graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Succinctness as a source of complexity in logical formalisms
+Normal rank
@@ Property / cites work @@
+Hyperedge replacement: grammars and languages
@@ Property / cites work: Hyperedge replacement: grammars and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Expressibility and Parallel Complexity
@@ Property / cites work: Expressibility and Parallel Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+Application of model theoretic games to discrete linear orders and finite automata
+Normal rank
@@ Property / cites work @@
+Hierarchical planarity testing algorithms
@@ Property / cites work: Hierarchical planarity testing algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
+Normal rank
@@ Property / cites work @@
+Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes and theories of finite models
@@ Property / cites work: Complexity classes and theories of finite models / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic uses of the Feferman-Vaught theorem
@@ Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Arity and alternation in second-order logic
@@ Property / cites work: Arity and alternation in second-order logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q4764625
@@ Property / cites work: Q4764625 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
+Normal rank
@@ Property / cites work @@
+Hierarchically specified unit disk graphs
@@ Property / cites work: Hierarchically specified unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2003 - Concurrency Theory
@@ Property / cites work: CONCUR 2003 - Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on succinct representations of graphs
@@ Property / cites work: A note on succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Decidability of DPDA equivalence
@@ Property / cites work: Decidability of DPDA equivalence / rank @@
+Normal rank
@@ Property / cites work @@
+The polynomial-time hierarchy
@@ Property / cites work: The polynomial-time hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Q4302435
@@ Property / cites work: Q4302435 / rank @@
+Normal rank
@@ Property / cites work @@
+The method of forced enumeration for nondeterministic automata
+Normal rank
@@ Property / cites work @@
+Languages represented by Boolean formulas
@@ Property / cites work: Languages represented by Boolean formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258578
@@ Property / cites work: Q4258578 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation, leaf languages, and projection reductions
+Normal rank
@@ Property / cites work @@
+Complete sets and the polynomial-time hierarchy
@@ Property / cites work: Complete sets and the polynomial-time hierarchy / rank @@
+Normal rank