Entry Creignou:1995:CPL from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Creignou:1995:CPL,
author = "Nadia Creignou",
title = "The class of problems that are linearly equivalent to
{Satisfiability} or a uniform method for proving
{NP}-completeness",
journal = j-THEOR-COMP-SCI,
volume = "145",
number = "1--2",
pages = "111--145",
day = "10",
month = jul,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:12 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=145&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=145&issue=1-2&aid=1816",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240C (Computational complexity)",
corpsource = "Dept. de Math., Caen Univ., France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "3-Colorability; 3-Dimensional Matching; 3-Exact Cover;
computability; computational complexity; computational
model; Cubic Subgraph; decidability; Kernel of Graph;
linear-time equivalent; linear-time transformations;
linearly equivalent; natural combinatorial problems;
NP- completeness; Partition into Hamiltonian Subgraphs;
Partition into Paths; Partition into Triangles; Path
with Forbidden Pairs; Path without Chord; Restricted
Perfect Matching; SAT-equivalent; satisfiability;
sorting; sortings; Turing machine; uniform method",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- chord,
204(1)55
- class,
139(1)187,
140(1)179,
140(2)291,
141(1)175,
143(1)149,
144(1)251,
148(2)207,
149(2)201,
149(2)299,
150(1)1,
151(2)385,
152(1)67,
152(2)251,
153(1)49,
154(1)23,
154(2)145,
154(2)307,
154(2)367,
155(1)111,
155(1)141,
155(2)447,
157(2)227,
158(1)193,
158(1)221,
158(1)361,
160(1)305,
161(1)263,
161(1)301,
161(1)307,
162(1)5,
163(1)245,
163(1)283,
164(1)287,
165(2)355,
167(1)171,
170(1)407,
172(1)43,
172(1)91,
174(1)67,
174(1)231,
174(1)269,
176(1)39,
176(1)205,
177(1)59,
177(1)139,
178(1)37,
179(1)217,
180(1)139,
180(1)155,
180(1)217,
180(1)325,
183(1)93,
185(1)159,
185(1)177,
186(1)231,
188(1)79,
188(1)101,
190(1)87,
191(1)215,
194(1)137,
194(1)246,
195(1)33,
195(2)113,
195(2)183,
195(2)205,
197(1)247,
198(1)225,
203(1)123,
207(1)217,
209(1)225,
211(1)253,
226(1)29,
234(1)323
- completeness,
138(2)273,
139(1)27,
141(1)109,
143(1)149,
146(1)243,
150(1)161,
151(1)3,
151(2)487,
152(1)139,
155(1)1,
160(1)241,
163(1)99,
164(1)141,
167(1)95,
170(1)173,
173(1)183,
175(1)29,
177(1)217,
183(2)187,
183(2)253,
185(2)393,
190(1)41,
195(1)61,
197(1)242-1,
197(1)243-1,
197(1)245-1,
197(1)246-2,
215(1)349,
227(1)249
- completeness, {NP}-,
225(1)65
- computability,
137(1)129,
139(1)243,
142(1)27,
147(1)31,
153(1)49,
154(2)145,
155(1)277,
157(1)79,
157(1)91,
157(2)267,
160(1)365,
161(1)109,
161(1)289,
162(1)5,
162(1)23,
162(1)45,
162(1)117,
163(1)177,
165(1)133,
166(1)147,
168(2)241,
168(2)461,
171(1)3,
172(1)233,
174(1)137,
175(1)183,
175(2)349,
181(1)195,
184(1)195,
190(2)279,
191(1)145,
191(1)229,
192(2)315,
193(1)149,
194(1)219,
194(1)247-1,
195(2)183,
210(1)73,
219(1)65,
219(1)185,
219(1)287,
219(1)421,
219(1)467,
219(1)487,
224(1)173
- cover,
142(2)299,
147(1)267,
149(1)129,
158(1)117,
164(1)299,
166(1)221,
174(1)23,
187(1)167,
205(1)85,
225(1)113,
225(1)163
- cubic,
145(1)147,
148(1)111,
226(1)19
- decidability,
138(1)3,
139(1)1,
139(1)27,
141(1)253,
146(1)243,
147(1)149,
147(1)165,
148(2)227,
148(2)281,
150(1)1,
154(1)23,
154(1)107,
155(2)321,
155(2)447,
156(1)119,
157(1)115,
158(1)161,
160(1)145,
160(1)185,
161(1)93,
161(1)141,
161(1)191,
164(1)29,
164(1)123,
164(1)141,
164(1)223,
165(2)247,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
168(2)241,
168(2)z,
170(1)1,
170(1)445,
172(1)67,
172(1)309,
174(1)217,
174(1)269,
175(1)15,
175(1)127,
175(1)z,
176(1)67,
176(1)111,
176(1)175,
176(1)235,
179(1)301,
180(1)61,
180(1)203,
183(1)83,
183(2)215,
186(1)231,
193(1)149,
193(1)181,
193(1)197,
194(1)87,
194(1)219,
195(1)33,
195(2)113,
197(1)79,
197(1)245,
198(1)1,
215(1)169,
216(1)363
- equivalent,
138(1)201,
139(1)115,
140(2)333,
179(1)319
- forbidden,
172(1)209
- Hamiltonian,
143(2)189,
145(1)147,
204(1)233
- kernel,
173(2)393,
176(1)235,
189(1)71,
193(1)75
- linear-time,
145(1)329,
147(1)19,
154(2)165,
158(1)177,
159(1)137,
163(1)309,
167(1)47,
181(1)57
- matching,
137(2)269,
141(1)53,
145(1)381,
147(1)19,
154(2)203,
154(2)225,
155(2)321,
156(1)217,
158(1)177,
159(1)105,
160(1)217,
161(1)1,
161(1)123,
163(1)117,
164(1)73,
164(1)299,
172(1)281,
173(2)349,
177(2)425,
178(1)129,
180(1)115,
180(1)203,
181(1)159,
185(2)347,
191(1)205,
197(1)247-2,
198(1)1,
201(1)263,
201(1)281,
212(1)101,
220(2)469
- natural,
140(1)5,
141(1)151,
142(2)179,
145(1)189,
150(1)161,
152(1)67,
160(1)305,
161(1)205,
162(1)5,
162(2)341,
163(1)269,
163(1)283,
166(1)173,
169(1)3,
174(1)23,
175(1)75,
175(1)z,
176(1)111,
176(1)159,
183(1)33,
185(2)217,
193(1)129,
194(1)240-1,
197(1)245,
197(1)248-1
- NP,
137(2)279,
141(1)175,
145(1)147,
147(1)55,
147(1)181,
148(2)207,
148(2)325,
150(1)1,
154(2)145,
154(2)283,
157(2)161,
158(1)143,
158(1)221,
160(1)185,
164(1)59,
164(1)141,
174(1)97,
181(2)229,
189(1)239
- pair,
141(1)311,
142(2)141,
146(1)311,
154(1)3,
154(2)329,
159(2)143,
168(1)121,
175(1)159,
182(1)145,
192(1)3,
205(1)99
- partition,
143(2)269,
148(1)93,
166(1)63,
175(2)283,
201(1)233
- path,
139(1)355,
140(2)205,
140(2)231,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
142(2)179,
142(2)277,
143(1)175,
143(2)343,
145(1)27,
145(1)45,
145(1)147,
145(1)329,
157(1)53,
157(1)101,
159(1)65,
160(1)87,
161(1)1,
166(1)49,
168(1)121,
175(1)127,
176(1)67,
183(1)21,
186(1)171,
188(1)1,
190(1)41,
196(1)395,
203(1)143,
203(2)205,
208(1)33,
215(1)89,
225(1)163
- perfect,
143(2)319,
145(1)381,
158(1)343,
164(1)253,
174(1)217,
182(1)1,
197(1)247-2
- proving,
138(1)101,
138(1)169,
138(2)243,
139(1)355,
141(1)69,
142(2)209,
142(2)229,
142(2)257,
142(2)299,
146(1)185,
146(1)199,
151(1)3,
151(2)487,
153(1)49,
154(1)3,
155(2)291,
155(2)439,
165(1)3,
165(1)57,
166(1)173,
166(1)291,
167(1)193,
169(1)3,
170(1)129,
170(1)245,
170(1)407,
172(1)1,
173(1)235,
173(1)283,
173(2)311,
173(2)393,
176(1)159,
177(1)183,
179(1)103,
180(1)371,
181(2)317,
183(2)187,
183(2)253,
189(1)71,
192(1)55,
194(1)244-3,
194(1)247-2,
197(1)245,
197(1)245-1,
197(1)246-1,
197(1)247-2,
198(1)201,
206(1)163,
206(1)341,
208(1)149
- restricted,
154(2)165,
174(1)23,
176(1)39,
183(2)281,
198(1)177,
203(1)151
- satisfiability,
137(1)129,
139(1)1,
146(1)243,
150(1)1,
155(1)277,
160(1)365,
161(1)109,
165(1)133,
166(1)147,
170(1)1,
171(1)3,
172(1)233,
175(2)349,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183
- sorting,
145(1)189,
154(2)225,
157(1)35,
163(1)211,
163(1)239,
164(1)1,
165(2)311,
174(1)193,
183(2)187,
188(1)241,
196(1)3,
196(1)109
- subgraph,
145(1)147,
148(1)57,
161(1)307,
164(1)287,
168(1)121,
172(1)209,
172(1)265,
181(1)91,
181(2)307,
203(1)91,
205(1)85,
205(1)261
- time, linear-,
145(1)329,
147(1)19,
154(2)165,
158(1)177,
159(1)137,
163(1)309,
167(1)47,
181(1)57
- transformation,
139(1)69,
139(1)243,
142(1)89,
143(2)285,
146(1)145,
146(1)269,
152(2)269,
154(2)329,
156(1)71,
156(1)301,
165(2)483,
166(1)101,
167(1)193,
178(1)1,
181(2)289,
184(1)145,
185(2)237,
190(1)61,
192(2)233,
194(1)57,
194(1)242,
194(1)242,
194(1)244-1,
194(1)245,
194(1)245-1,
194(1)246,
194(1)248-1,
195(2)259,
216(1)109,
216(1)311
- triangle,
164(1)165,
181(2)379,
182(1)233
- Turing,
138(1)67,
143(1)123,
143(1)159,
148(1)33,
148(2)325,
158(1)193,
161(1)301,
162(1)45,
168(2)215,
168(2)241,
168(2)257,
168(2)267,
168(2)303,
168(2)321,
168(2)417,
168(2)461,
168(2)z,
172(1)135,
174(1)203,
174(1)217,
180(1)139,
180(1)229,
180(1)341,
181(1)119,
182(1)159,
191(1)215,
192(2)315,
194(1)137,
197(1)79,
210(1)217,
217(1)3,
411(31)2999
- uniform,
142(2)257,
144(1)67,
144(1)161,
145(1)381,
147(1)149,
151(1)277,
163(1)117,
180(1)17,
180(1)229,
183(2)187,
184(1)237,
188(1)231,
194(1)163,
196(1)259,
196(1)395,
203(1)69,
206(1)219,
218(2)233,
219(1)301,
220(1)67,
221(1)457
- {NP}-completeness,
225(1)65