Quasiconvex Analysis of Backtracking Algorithms
From MaRDI portal
Publication:5501340
zbMath1318.68210arXivcs/0304018MaRDI QIDQ5501340
Publication date: 3 August 2015
Full work available at URL: https://arxiv.org/abs/cs/0304018
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances ⋮ Exact Algorithms for Edge Domination ⋮ Linear-programming design and analysis of fast algorithms for Max 2-CSP ⋮ All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
Uses Software
This page was built for publication: Quasiconvex Analysis of Backtracking Algorithms
