Entry Naik:1995:QTC 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{Naik:1995:QTC,
author = "Ashish V. Naik and Kenneth W. Regan and D. Sivakumar",
title = "On quasilinear-time complexity theory",
journal = j-THEOR-COMP-SCI,
volume = "148",
number = "2",
pages = "325--349",
day = "04",
month = sep,
year = "1995",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:19:21 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=148&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=1995&volume=148&issue=2&aid=1972",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques); C4220 (Automata theory);
C4240C (Computational complexity)",
conflocation = "Caen, France; 24-26 Feb. 1994",
conftitle = "11th Symposium on Theoretical Aspects of Computer
Science (STACS '94)",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Buffalo, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded-query Turing reductions; computational
complexity; decision problems; decision theory;
equivalence; error correction codes; error-correcting
codes; NP languages; polynomial-time hierarchy;
quasilinear-time complexity theory; robust oracle
machines; search problems; Turing machines;
Valiant-Vazirani reduction",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- code,
141(1)1,
144(1)161,
145(1)345,
147(1)165,
148(2)227,
154(2)283,
155(2)425,
159(1)103,
160(1)145,
162(2)297,
163(1)145,
163(1)259,
164(1)223,
165(2)407,
172(1)309,
176(1)337,
181(2)337,
182(1)245,
183(1)3,
187(1)231,
188(1)231,
191(1)117,
192(2)201,
196(1)347,
196(1)365,
197(1)246,
204(1)11,
215(1)345,
218(1)107
- correction,
201(1)275
- decision,
138(1)35,
141(1)133,
141(1)283,
142(2)229,
145(1)45,
146(1)199,
148(2)227,
157(2)161,
158(1)161,
158(1)343,
164(1)13,
164(1)141,
165(2)247,
166(1)1,
170(1)1,
174(1)269,
180(1)1,
180(1)47,
188(1)59,
207(2)329,
208(1)111,
223(1)1,
224(1)157,
224(1)319
- error,
134(1)51,
148(1)141,
149(1)129,
156(1)1,
157(2)277,
161(1)235,
162(1)151,
176(1)89,
182(1)217,
188(1)79,
196(1)131,
203(1)163
- hierarchy,
137(2)279,
139(1)131,
141(1)253,
148(1)33,
148(2)183,
148(2)207,
148(2)303,
149(1)49,
154(1)23,
155(2)447,
158(1)221,
159(2)343,
161(1)205,
161(1)235,
161(1)263,
167(1)235,
174(1)231,
174(1)259,
177(1)59,
179(1)251,
181(2)229,
184(1)237,
186(1)157,
191(1)37,
191(1)97,
192(2)315,
193(1)129,
194(1)137,
195(2)133,
198(1)99,
205(1)45,
205(1)317,
207(1)89,
207(1)131,
210(1)21,
215(1)289
- Naik, Ashish V.,
207(1)131
- NP,
137(2)279,
141(1)175,
145(1)111,
145(1)147,
147(1)55,
147(1)181,
148(2)207,
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
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
194(1)207,
196(1)365,
197(1)245-2
- oracle,
154(1)23,
157(2)227,
158(1)221,
180(1)17,
181(1)119,
185(1)129,
191(1)185,
194(1)137
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- reduction,
135(1)67,
139(1)69,
145(1)147,
146(1)269,
148(1)19,
148(2)183,
151(2)353,
151(2)437,
152(1)91,
154(1)3,
154(1)23,
155(1)85,
155(2)447,
158(1)361,
159(2)191,
161(1)69,
165(1)75,
166(1)1,
168(1)3,
170(1)83,
173(1)151,
175(1)93,
177(1)183,
181(2)229,
185(2)237,
188(1)101,
189(1)221,
190(1)3,
190(1)61,
191(1)97,
191(1)157,
192(1)31,
192(1)55,
194(1)241-2,
194(1)244-1,
194(1)244-3,
194(1)245-2,
194(1)247-2,
194(1)248-2,
197(1)242-2,
198(1)239,
209(1)47,
212(1)211,
225(1)185
- Regan, Kenneth W.,
161(1)263,
188(1)101,
191(1)97
- robust,
159(2)245
- search,
137(2)253,
144(1)101,
144(1)161,
144(1)199,
144(1)251,
146(1)199,
147(1)19,
154(2)225,
156(1)39,
156(1)315,
163(1)117,
164(1)1,
164(1)141,
164(1)185,
167(1)95,
168(1)21,
172(1)265,
181(1)119,
182(1)217,
188(1)1,
188(1)221,
191(1)229,
197(1)245-2,
203(1)51,
205(1)243,
229(1)103
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- Turing,
138(1)67,
143(1)123,
143(1)159,
145(1)111,
148(1)33,
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