Applying Modern SAT-solvers to Solving Hard Problems

DOI10.3233/FI-2019-1788zbMath1412.68088OpenAlexW2934772558WikidataQ128167982 ScholiaQ128167982MaRDI QIDQ5377330

Artur Niewiadomski, Piotr Switalski, Teofil Sidoruk, Wojciech Penczek

Publication date: 24 May 2019

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2019-1788

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference

This page was built for publication: Applying Modern SAT-solvers to Solving Hard Problems