Optimal length tree-like refutations of linear feasibility in UTVPI constraints
From MaRDI portal
Publication:777309
DOI10.1007/978-3-319-78455-7_23zbMath1446.68143OpenAlexW2790386454MaRDI QIDQ777309
Matthew Williamson, K. Subramani and Vahan Mkrtchyan, Piotr J. Wojciechowski
Publication date: 7 July 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-78455-7_23
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items (2)
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints ⋮ On integer closure in a system of unit two variable per inequality constraints
This page was built for publication: Optimal length tree-like refutations of linear feasibility in UTVPI constraints
