Selection of search strategies for solving 3-sat problems
International Journal of Applied Mathematics and Computer Science (2014)
- Volume: 24, Issue: 2, page 283-297
- ISSN: 1641-876X
Access Full Article
top
How to cite
topPułka, Andrzej. "Selection of search strategies for solving 3-sat problems." International Journal of Applied Mathematics and Computer Science 24.2 (2014): 283-297. <http://eudml.org/doc/271893>.
@article{Pułka2014,
author = {Pułka, Andrzej},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {SAT solving; formal verification; CNF; Boolean satisfiability},
language = {eng},
number = {2},
pages = {283-297},
publisher = {University of Zielona Gora Press},
title = {Selection of search strategies for solving 3-sat problems},
url = {http://eudml.org/doc/271893},
volume = {24},
year = {2014},
}
TY - JOUR
AU - Pułka, Andrzej
TI - Selection of search strategies for solving 3-sat problems
JO - International Journal of Applied Mathematics and Computer Science
PY - 2014
PB - University of Zielona Gora Press
VL - 24
IS - 2
SP - 283
EP - 297
LA - eng
KW - SAT solving; formal verification; CNF; Boolean satisfiability
UR - http://eudml.org/doc/271893
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.