Entry Boros:2013:DMC from tcs2010.bib
Last update: Sun Mar 31 03:12:29 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Boros:2013:DMC,
author = "Endre Boros and Ondrej Cepek and Petr Kucera",
title = "A decomposition method for {CNF} minimality proofs",
journal = j-THEOR-COMP-SCI,
volume = "510",
number = "??",
pages = "111--126",
day = "28",
month = oct,
year = "2013",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Nov 4 10:04:17 MST 2013",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397513006968",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- CNF,
412(35)4613,
481(z)85
- decomposition,
411(14)1648,
411(31)2827,
412(35)4688,
412(43)6002,
443(1)70,
454(1)38,
479(z)43,
522(z)95,
526(z)41,
537(z)105
- method,
411(51)4358,
412(15)1325,
412(16)1492,
412(23)2524,
412(35)4493,
412(42)5909,
422(1)1,
428(1)58,
429(1)169,
448(1)9,
475(z)21,
479(z)127,
481(z)9,
482(z)48,
501(z)52,
511(z)13,
522(z)24,
522(z)95,
554(z)95,
558(z)35
- minimality,
429(1)282,
440(0)73,
522(z)95
- proof,
411(3)677,
411(51)4358,
412(11)1022,
412(20)1941,
412(20)1958,
412(23)2468,
415(1)1,
428(1)92,
461(1)55,
464(1)90,
474(z)98,
475(z)120,
478(z)1,
480(z)26,
492(z)40,
497(z)84,
512(z)41,
546(z)164,
549(z)36,
554(z)229