The complexity of searching implicit graphs (Q2676567): Difference between revisions

@@ Property / describes a project that uses @@
+LEDA
@@ Property / describes a project that uses: LEDA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Datalog
@@ Property / describes a project that uses: Datalog / 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.1016/0004-3702(96)00014-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2079114230
@@ Property / OpenAlex ID: W2079114230 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039803
@@ Property / cites work: Q4039803 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Constant Depth Reducibility
@@ Property / cites work: Constant Depth Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representations of graphs
@@ Property / cites work: Succinct representations of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3720323
@@ Property / cites work: Q3720323 / rank @@
+Normal rank
@@ Property / cites work @@
+On Some Deterministic Space Complexity Problems
@@ Property / cites work: On Some Deterministic Space Complexity Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385525
@@ Property / cites work: Q4385525 / rank @@
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Complete problems for deterministic polynomial time
+Normal rank
@@ Property / cites work @@
+New problems complete for nondeterministic log space
+Normal rank
@@ Property / cites work @@
+Q3359769
@@ Property / cites work: Q3359769 / rank @@
+Normal rank
@@ Property / cites work @@
+A new variant of the \(A^*\)-algorithm which closes a node at most once.
+Normal rank
@@ Property / cites work @@
+The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
+Normal rank
@@ Property / cites work @@
+The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the parity argument and other inefficient proofs of existence
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / 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 @@
+Provably Difficult Combinatorial Games
@@ Property / cites work: Provably Difficult Combinatorial Games / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of combinatorial problems with succinct input representation
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2676567