Entry Dubois:1991:PAS from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
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{Dubois:1991:PAS,
author = "O. Dubois and J. Carlier",
title = "Probabilistic approach to the satisfiability problem",
journal = j-THEOR-COMP-SCI,
volume = "81",
number = "1",
pages = "65--75",
day = "22",
month = apr,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "LAFORIA, CRNS, Paris VI Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; exponential time complexity;
mathematical expectation; NP-complete problems;
polynomial time complexity; probabilistic approach;
satisfiability problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- approach,
71(2)209,
71(3)347,
79(1)179,
80(1)105,
85(2)253,
85(2)305,
90(1)37,
93(1)91,
97(1)1,
100(2)385,
101(2)265,
104(2)263,
109(1)123,
109(1)181,
112(1)53,
119(1)23,
128(1)63,
128(1)159,
129(1)167,
129(2)337,
130(1)203,
131(2)271,
133(1)105,
133(2)387,
135(2)171,
135(2)267,
136(1)183
- complete, NP-,
80(2)203,
81(1)49,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- Dubois, O.,
81(1)49
- exponential,
81(2)169,
83(2)313,
84(1)77,
86(2)325,
94(2)295,
98(2)289,
106(2)351,
107(1)121,
108(2)291,
111(1)145,
116(1)33,
117(1)169,
131(2)331,
134(1)225,
134(1)253,
134(2)545,
136(2)487
- mathematical,
74(2)163,
76(1)53,
76(2)331,
79(1)195,
79(1)209,
84(2)281,
85(2)333,
94(2)311,
95(1)159,
96(2)389,
101(2)239,
103(2)311,
103(2)335,
104(1)89,
106(2)283,
110(1)197,
110(2)249,
111(1)z,
116(1)3,
116(2)227,
123(1)55,
123(1)117,
134(2)403,
135(1)z
- NP-complete,
80(2)203,
81(1)49,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- probabilistic,
79(1)37,
85(2)305,
88(1)1,
92(2)249,
93(2)201,
93(2)265,
106(2)395,
113(1)167,
116(2)373,
123(1)131,
125(1)17
- satisfiability,
72(2)265,
72(2)z,
81(1)49,
82(1)141,
94(1)101,
105(1)141,
116(2)405,
129(1)95,
134(2)287