Q5089177 (Q5089177): Difference between revisions

@@ Property / cites work @@
+The complexity of planarity testing
@@ Property / cites work: The complexity of planarity testing / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Q3503433
@@ Property / cites work: Q3503433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002828
@@ Property / cites work: Q3002828 / rank @@
+Normal rank
@@ Property / cites work @@
+A general Sequential Time-Space Tradeoff for Finding Unique Elements
+Normal rank
@@ Property / cites work @@
+A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
+Normal rank
@@ Property / cites work @@
+A time-space tradeoff for sorting on non-oblivious machines
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+Normal rank
@@ Property / cites work @@
+Advice classes of parametrized tractability
@@ Property / cites work: Advice classes of parametrized tractability / rank @@
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+A Framework for In-place Graph Algorithms
@@ Property / cites work: A Framework for In-place Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Resistance from Pairwise-Independent Subgroups
+Normal rank
@@ Property / cites work @@
+Selection and Sorting in the “Restore” Model
@@ Property / cites work: Selection and Sorting in the “Restore” Model / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding and canonizing graphs of bounded genus in logspace
+Normal rank
@@ Property / cites work @@
+A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
+Normal rank
@@ Property / cites work @@
+Upper bounds for time-space trade-offs in sorting and selection
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+A parallel approximation algorithm for positive linear programming
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+Selection from read-only memory and sorting with minimum data movement
+Normal rank
@@ Property / cites work @@
+Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
+Normal rank
@@ Property / cites work @@
+A simple local 3-approximation algorithm for vertex cover
+Normal rank
@@ Property / cites work @@
+Q4719333
@@ Property / cites work: Q4719333 / rank @@
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank
@@ Property / cites work @@
+Symmetric Complementation
@@ Property / cites work: Symmetric Complementation / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Approximating linear programming is log-space complete for P
+Normal rank
@@ Property / cites work @@
+Logspace optimization problems and their approximability properties
+Normal rank
@@ Property / cites work @@
+Parallel approximation algorithms by positive linear programming
+Normal rank
@@ Property / cites work @@
+Q4955353
@@ Property / cites work: Q4955353 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems
+Normal rank