The STO problem is NP-complete

From MaRDI portal

Publication:1284283

Jump to:navigation, search

DOI10.1006/JSCO.1998.0249zbMath0936.68020OpenAlexW2046996422MaRDI QIDQ1284283

Leszek Pacholski, Piotr Krysta

Publication date: 25 May 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1967ac9560577ec514a1c9417dcd9add484e957f

Mathematics Subject Classification ID

Logic programming (68N17)

This page was built for publication: The STO problem is NP-complete

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1284283&oldid=13386571"