On the size of minimal unsatisfiable formulas.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper N3, 5 p.-Research Paper N3, 5 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topLee, Choongbum. "On the size of minimal unsatisfiable formulas.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper N3, 5 p.-Research Paper N3, 5 p.. <http://eudml.org/doc/117286>.
@article{Lee2009,
author = {Lee, Choongbum},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {minimal unsatisfiable formulas; critically 3-connected hypergraphs},
language = {eng},
number = {1},
pages = {Research Paper N3, 5 p.-Research Paper N3, 5 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {On the size of minimal unsatisfiable formulas.},
url = {http://eudml.org/doc/117286},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Lee, Choongbum
TI - On the size of minimal unsatisfiable formulas.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper N3, 5 p.
EP - Research Paper N3, 5 p.
LA - eng
KW - minimal unsatisfiable formulas; critically 3-connected hypergraphs
UR - http://eudml.org/doc/117286
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.