Pages that link to "Item:Q5466451"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466451):
Displaying 15 items.
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Pathwidth of cubic graphs and exact algorithms (Q1045933) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG (Q2379999) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q4638059) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- (Q5090378) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
