Publication:3113789
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2010.2494zbMath1230.68187MaRDI QIDQ3113789
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f76b.html
Linear programming (90C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
An improved time-space lower bound for tautologies, Limits on alternation trading proofs for time-space lower bounds, Computing (and Life) Is All about Tradeoffs