Pages that link to "Item:Q4562283"
From MaRDI portal
The following pages link to If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283):
Displaying 22 items.
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Computing the depth distribution of a set of boxes (Q2049979) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- (Q4638059) (← links)
- Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (Q5041266) (← links)
- (Q5090377) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- (Q5091007) (← links)
- (Q5091155) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- (Q5867524) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
