Entry Peer:1997:SPI 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{Peer:1997:SPI,
author = "Itsik Pe'er and Ron Shamir",
title = "Satisfiability problems on intervals and unit
intervals",
journal = j-THEOR-COMP-SCI,
volume = "175",
number = "2",
pages = "349--372",
day = "10",
month = apr,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:46 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=175&issue=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=1997&volume=175&issue=2&aid=2410",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4240C
(Computational complexity)",
corpsource = "Dept. of Comput. Sci., Tel Aviv Univ., Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computational complexity; graph theory;
interval graph; interval order recognition; interval
satisfiability; linear time algorithm; NP-completeness;
order constraints; satisfiability; unit intervals",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- completeness;, NP-,
147(1)69,
165(2)483,
168(1)3,
188(1)129
- computability,
137(1)129,
139(1)243,
142(1)27,
145(1)111,
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,
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
- constraint,
138(1)211,
141(1)151,
142(1)27,
142(2)141,
151(1)37,
151(1)z,
156(1)217,
158(1)279,
160(1)365,
166(1)101,
167(1)73,
171(1)25,
172(1)233,
173(1)3,
173(1)89,
173(1)113,
173(1)151,
173(1)183,
173(1)209,
173(1)235,
173(1)253,
173(1)283,
179(1)273,
183(2)281,
184(1)195,
185(1)81,
187(1)49,
190(2)115,
190(2)151,
192(1)77,
192(1)107,
192(2)259,
192(2)315,
193(1)149,
197(1)1,
206(1)81,
206(1)257,
221(1)179,
225(1)113
- interval,
143(1)73,
145(1)291,
148(1)93,
151(1)257,
162(1)151,
162(2)225,
166(1)1,
170(1)1,
173(1)3,
173(1)253,
174(1)171,
175(2)309,
205(1)115,
219(1)421
- NP-completeness,
147(1)69,
165(2)483,
168(1)3,
188(1)129
- order,
138(2)273,
142(1)89,
143(1)73,
144(1)101,
145(1)271,
147(1)149,
151(1)207,
151(1)z,
154(2)165,
154(2)379,
156(1)119,
160(1)87,
160(1)241,
160(1)271,
160(1)305,
162(2)351,
163(1)117,
163(1)269,
168(1)155,
170(1)145,
174(1)67,
175(1)3,
175(1)127,
175(2)225,
175(2)283,
175(2)337,
175(2)373,
175(2)393,
176(1)67,
176(1)235,
177(1)59,
177(1)217,
179(1)137,
179(1)217,
179(1)421,
180(1)17,
183(2)157,
183(2)187,
184(1)61,
185(2)277,
187(1)7,
187(1)27,
190(2)317,
194(1)245,
194(1)246,
200(1)205,
204(1)131,
212(1)211,
225(1)177
- recognition,
140(2)319,
143(1)73,
143(2)343,
145(1)329,
145(1)357,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
156(1)281,
160(1)217,
163(1)117,
163(1)303,
172(1)209,
173(2)349,
175(2)393,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
180(1)269,
181(2)379,
197(1)189,
201(1)99
- satisfiability,
137(1)129,
139(1)1,
145(1)111,
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,
181(1)195,
184(1)195,
191(1)145,
193(1)149,
195(2)183
- unit,
151(1)257,
155(2)291,
159(1)105,
174(1)23,
178(1)119,
217(1)3,
219(1)421