Entry Makino:2011:EAB 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{Makino:2011:EAB,
author = "Kazuhisa Makino and Suguru Tamaki and Masaki
Yamamoto",
title = "An exact algorithm for the {Boolean} connectivity
problem for $k$-{CNF}",
journal = j-THEOR-COMP-SCI,
volume = "412",
number = "35",
pages = "4613--4618",
day = "12",
month = aug,
year = "2011",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Tue Aug 30 18:51:47 MDT 2011",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- $k$,
411(7)967,
411(7)986,
412(3)209,
412(3)240,
412(16)1457,
412(33)4273,
412(35)4513,
412(35)4558,
412(39)5132,
412(46)6570,
414(1)47,
423(1)19,
425(1)58,
429(1)98,
442(1)13,
442(1)22,
443(1)63,
450(1)22,
454(1)164,
454(1)172,
459(1)42,
460(1)34,
461(1)2,
491(z)103,
494(z)63,
499(z)38,
505(z)19,
512(z)41,
513(z)96,
513(z)124,
525(z)80,
535(z)54,
542(z)83,
547(z)82,
557(z)66
- boolean,
411(1)266,
411(11)1338,
411(16)1723,
411(26)2612,
411(31)2864,
412(8)703,
412(8)773,
412(12)1169,
412(26)2816,
412(35)4650,
412(39)5132,
425(1)34,
447(1)120,
449(1)23,
457(1)149,
480(z)43,
481(z)24,
487(z)23,
501(z)82,
504(z)12,
505(z)74,
516(z)101,
523(z)86,
559(z)20
- CNF,
481(z)85,
510(z)111
- connectivity,
412(45)6390,
453(1)2,
463(1)26,
472(z)46,
493(z)46,
494(z)49,
496(z)2,
555(z)35,
560(z)292
- exact,
218(1)95,
411(7)1045,
411(22)2223,
411(31)2968,
411(40)3701,
412(4)352,
412(15)1325,
412(29)3530,
412(39)5298,
412(45)6290,
412(50)6913,
421(1)25,
440(0)60,
479(z)22,
491(z)1,
505(z)42,
511(z)109,
526(z)18,
538(z)70,
538(z)140,
542(z)32,
545(z)76,
547(z)122,
560(z)207
- Makino, Kazuhisa,
411(44)3956,
482(z)33,
540(z)62
- Tamaki, Suguru,
411(7)1182
- Yamamoto, Masaki,
411(16)1685