Taking it to the limit: On infinite variants of NP-complete problems
From MaRDI portal
Publication:1816727
DOI10.1006/JCSS.1996.0060zbMath0859.68016OpenAlexW1984103222MaRDI QIDQ1816727
Publication date: 13 March 1997
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0060
Related Items (2)
Infinite versions of some problems from finite complexity theory ⋮ Some natural decision problems in automatic graphs
This page was built for publication: Taking it to the limit: On infinite variants of NP-complete problems
