scientific article; zbMATH DE number 5034135

From MaRDI portal

Publication:5473177

Jump to:navigation, search

zbMath1101.68848MaRDI QIDQ5473177

Publication date: 19 June 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completeness minimal unsatisfiable formula SAT-problem construction of formula polynomially reduction

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

The complexity of variable minimal formulas

This page was built for publication:

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