scientific article; zbMATH DE number 6846407
From MaRDI portal
Publication:4606306
DOI10.4230/LIPIcs.ESA.2016.36zbMath1397.68097MaRDI QIDQ4606306
Jesper Nederlof, Rahul Santhanam, Andrew Drucker
Publication date: 2 March 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space ⋮ Width, depth, and space: tradeoffs between branching and dynamic programming
This page was built for publication:
