Succinct representation, leaf languages, and projection reductions (Q1271623): Difference between revisions

@@ Property / DOI @@
-.1006/inco.1997.2696
@@ Property / DOI: 10.1006/inco.1997.2696 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.1997.2696
+Normal rank
@@ Property / OpenAlex ID @@
+W2061161327
@@ Property / OpenAlex ID: W2061161327 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281518
@@ Property / cites work: Q4281518 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+On uniformity within \(NC^ 1\)
@@ Property / cites work: On uniformity within \(NC^ 1\) / rank @@
+Normal rank
@@ Property / cites work @@
+Q4835660
@@ Property / cites work: Q4835660 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct circuit representations and leaf language classes are basically the same concept
+Normal rank
@@ Property / cites work @@
+A characterization of the leaf language classes
@@ Property / cites work: A characterization of the leaf language classes / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity classes and sparse oracles
@@ Property / cites work: Complexity classes and sparse oracles / rank @@
+Normal rank
@@ Property / cites work @@
+A uniform approach to define complexity classes
@@ Property / cites work: A uniform approach to define complexity classes / rank @@
+Normal rank
@@ Property / cites work @@
+The dot-depth hierarchy of star-free languages is infinite
+Normal rank
@@ Property / cites work @@
+PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
@@ Property / cites work: PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221973
@@ Property / cites work: Q3221973 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representations of graphs
@@ Property / cites work: Succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Second order logic and the weak exponential hierarchies
+Normal rank
@@ Property / cites work @@
+On balanced versus unbalanced computation trees
@@ Property / cites work: On balanced versus unbalanced computation trees / rank @@
+Normal rank
@@ Property / cites work @@
+Languages that Capture Complexity Classes
@@ Property / cites work: Languages that Capture Complexity Classes / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of iterated multiplication
@@ Property / cites work: The complexity of iterated multiplication / rank @@
+Normal rank
@@ Property / cites work @@
+Logspace and logtime leaf languages
@@ Property / cites work: Logspace and logtime leaf languages / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of graph problems with succinct multigraph representation
+Normal rank
@@ Property / cites work @@
+Q3359769
@@ Property / cites work: Q3359769 / 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 @@
+Q4023358
@@ Property / cites work: Q4023358 / rank @@
+Normal rank
@@ Property / cites work @@
+Some Remarks on Generalized Spectra
@@ Property / cites work: Some Remarks on Generalized Spectra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4694758
@@ Property / cites work: Q4694758 / 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 @@
+Complete Problems Involving Boolean Labelled Structures and Projection Transactions
+Normal rank
@@ Property / cites work @@
+Using the Hamiltonian path operator to capture NP
@@ Property / cites work: Using the Hamiltonian path operator to capture NP / rank @@
+Normal rank
@@ Property / cites work @@
+Methods for proving completeness via logical reductions
+Normal rank
@@ Property / cites work @@
+Q4202957
@@ Property / cites work: Q4202957 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility by algebraic projections
@@ Property / cites work: Reducibility by algebraic projections / rank @@
+Normal rank
@@ Property / cites work @@
+RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ Property / DOI @@
+.1006/INCO.1997.2696
@@ Property / DOI: 10.1006/INCO.1997.2696 / rank @@
+Normal rank