On self-transformable combinatorial problems
From MaRDI portal
Publication:3896845
DOI10.1007/BFb0120931zbMath0449.90071MaRDI QIDQ3896845
Publication date: 1981
Published in: Mathematical Programming Studies (Search for Journal in Brave)
computational complexityNP-completenesspolynomial algorithmsself-transformable combinatorial problems
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Boolean programming (90C09)
Related Items (5)
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P ⋮ Constructive complexity ⋮ On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas ⋮ Strong Backdoors for Default Logic ⋮ Backdoors to tractable answer set programming
This page was built for publication: On self-transformable combinatorial problems
