Automatic Evaluation of Reductions between NP-Complete Problems

DOI10.1007/978-3-319-09284-3_30zbMath1423.68190OpenAlexW1480468592MaRDI QIDQ3192087

Pau Fernández, Carles Creus, Guillem Godoy

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_30

zbMATH Keywords

NP-completenessreductionsself-learningSAT application

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Automatic Evaluation of Reductions between NP-Complete Problems