Automata, Languages and Programming
From MaRDI portal
Publication:5466451
DOI10.1007/b99859zbMath1098.68120OpenAlexW2505584480MaRDI QIDQ5466451
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG ⋮ Subquadratic algorithms for succinct stable matching ⋮ Fine-Grained Complexity of Regular Path Queries ⋮ A faster polynomial-space algorithm for Max 2-CSP ⋮ Linear-programming design and analysis of fast algorithms for Max 2-CSP ⋮ An exact algorithm for the Boolean connectivity problem for \(k\)-CNF ⋮ A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP ⋮ Open problems around exact algorithms ⋮ Solving connected dominating set faster than \(2^n\) ⋮ Unnamed Item ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Pathwidth of cubic graphs and exact algorithms ⋮ Unnamed Item ⋮ A \#SAT algorithm for small constant-depth circuits with PTF gates
Uses Software
This page was built for publication: Automata, Languages and Programming
