Strong ETH and Resolution via Games and the Multiplicity of Strategies.
From MaRDI portal
Publication:5363779
DOI10.4230/LIPIcs.IPEC.2015.248zbMath1378.03042OpenAlexW2275373716MaRDI QIDQ5363779
Navid Talebanfard, Ilario Bonacina
Publication date: 29 September 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2015.248
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
This page was built for publication: Strong ETH and Resolution via Games and the Multiplicity of Strategies.