Optimal length tree-like refutations of linear feasibility in UTVPI constraints

From MaRDI portal
Revision as of 12:04, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:777309


DOI10.1007/978-3-319-78455-7_23zbMath1446.68143MaRDI 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


68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

90C27: Combinatorial optimization

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68W20: Randomized algorithms