Incremental delay enumeration: space and time (Q2274091): Difference between revisions

@@ Property / cites work @@
+Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all solutions of generalized satisfiability problems
+Normal rank
@@ Property / cites work @@
+A complexity theory for hard enumeration problems
@@ Property / cites work: A complexity theory for hard enumeration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Paradigms for parameterized enumeration
@@ Property / cites work: Paradigms for parameterized enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
+Normal rank
@@ Property / cites work @@
+Boltzmann Samplers for the Random Generation of Combinatorial Structures
+Normal rank
@@ Property / cites work @@
+Q4536368
@@ Property / cites work: Q4536368 / rank @@
+Normal rank
@@ Property / cites work @@
+New Results on Monotone Dualization and Generating Hypergraph Transversals
+Normal rank
@@ Property / cites work @@
+Q3285941
@@ Property / cites work: Q3285941 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic counting algorithms for data base applications
+Normal rank
@@ Property / cites work @@
+On the Complexity of Dualization of Monotone Disjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Algorithms
@@ Property / cites work: On the Computational Complexity of Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The Journey from NP to TFNP Hardness
@@ Property / cites work: The Journey from NP to TFNP Hardness / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Some Enumeration Problems for Matroids
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Q4601904
@@ Property / cites work: Q4601904 / rank @@
+Normal rank
@@ Property / cites work @@
+On total functions, existence theorems and computational complexity
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of the Monomials of a Polynomial and Related Complexity Classes
+Normal rank
@@ Property / cites work @@
+On enumerating monomials and other combinatorial structures by polynomial interpolation
+Normal rank
@@ Property / cites work @@
+Interpolating polynomials from their values
@@ Property / cites work: Interpolating polynomials from their values / rank @@
+Normal rank