Entry Yamakami:2012:DTA 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{Yamakami:2012:DTA,
author = "Tomoyuki Yamakami",
title = "A dichotomy theorem for the approximate counting of
complex-weighted bounded-degree {Boolean} {CSPs}",
journal = j-THEOR-COMP-SCI,
volume = "447",
number = "1",
pages = "120--135",
day = "17",
month = aug,
year = "2012",
CODEN = "TCSCDI",
DOI = "https://doi.org/10.1016/j.tcs.2012.03.036",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Jun 30 13:07:19 MDT 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs2010.bib",
URL = "http://www.sciencedirect.com/science/article/pii/S0304397512003088",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}
Related entries
- approximate,
411(1)164,
411(40)3701,
411(43)3814,
412(29)3537,
412(29)3579,
412(39)5298,
412(45)6359,
426(1)1,
432(1)28,
439(1)58,
463(1)96,
479(z)127,
481(z)9,
483(z)10,
487(z)37,
521(z)42,
525(z)60
- 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)4613,
412(35)4650,
412(39)5132,
425(1)34,
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
- bounded-degree,
498(z)46
- complex-weighted,
461(1)86
- counting,
411(22)2331,
411(26)2591,
411(31)2987,
411(34)3001,
411(43)3823,
412(4)419,
412(23)2468,
417(1)2,
417(1)36,
437(1)35,
439(1)58,
458(1)29,
461(1)86,
474(z)80,
492(z)88,
502(z)4,
526(z)41,
544(z)60,
552(z)44,
552(z)83,
552(z)99,
683(z)31
- dichotomy,
412(22)2370
- theorem,
411(2)341,
412(4)448,
412(12)1140,
412(35)4604,
424(1)1,
430(1)43,
435(1)106,
454(1)72,
454(1)199,
457(1)101,
478(z)1,
486(z)4,
527(z)37,
535(z)31,
546(z)225,
554(z)2
- weighted, complex-,
461(1)86
- Yamakami, Tomoyuki,
411(1)22,
412(45)6432,
461(1)86