Entry Ladner:1975:CPT from tcs1975.bib
Last update: Thu Sep 27 02:46:39 MDT 2018
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 |
Y |
Z
BibTeX entry
@Article{Ladner:1975:CPT,
author = "R. E. Ladner and N. A. Lynch and A. L. Selman",
title = "A comparison of polynomial time reducibilities",
journal = j-THEOR-COMP-SCI,
volume = "1",
number = "2",
pages = "103--123",
month = dec,
year = "1975",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Univ. of Washington, Seattle, WA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "bounded truth table; computational complexity;
nondeterminism; polynomial time reducibilities;
recursive function theory; recursive functions; truth
table; Turing reducibility",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algorithm,
1(1)13,
1(1)21,
1(1)27,
1(2)185,
1(3)193,
1(3)215,
1(3)227,
1(4)269,
1(4)289,
2(1)73,
2(2)183,
2(2)228,
2(3)345,
3(2)267,
3(3)293,
3(3)321,
3(3)349,
4(1)59,
4(1)77,
4(2)155,
4(2)171,
4(3)321,
5(1)25,
5(2)113,
5(2)135,
5(2)183,
5(2)205,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)281,
6(3)317,
7(1)1,
7(1)79,
7(1)99,
7(2)127,
7(3)239,
7(3)273,
8(1)45,
8(1)57,
8(1)73,
8(3)271,
8(3)325,
8(3)379,
9(1)1,
9(1)39,
9(1)83,
9(1)127,
9(2)329,
9(2)347
- bounded,
2(1)49,
3(2)213,
3(3)273,
8(2)239
- C4240,
1(1)13,
1(1)21,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(2)183,
2(2)228,
3(2)267,
3(3)349,
4(1)59,
4(2)155,
4(2)171,
5(1)25,
5(2)113,
5(2)135,
5(2)205,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)281,
6(3)317,
7(1)79,
7(1)99,
7(3)239,
7(3)273,
8(1)57,
8(1)73,
8(3)325,
8(3)379,
9(1)39,
9(1)83,
9(1)127,
9(2)329,
9(2)347
- complexity,
1(1)13,
1(1)21,
1(1)59,
1(2)161,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(3)305,
2(3)383,
2(3)397,
3(1)1,
3(1)23,
3(1)105,
3(2)213,
3(2)267,
3(3)305,
3(3)349,
4(1)23,
4(2)171,
4(3)277,
5(2)205,
6(1)41,
6(1)93,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)273,
8(2)189,
8(2)203,
8(2)227,
8(2)239,
8(2)255,
9(1)83,
9(1)127
- computational,
1(1)13,
1(1)21,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(3)305,
2(3)397,
3(1)1,
3(1)23,
3(1)105,
3(2)267,
3(3)305,
3(3)349,
4(1)23,
4(3)277,
5(2)205,
6(1)41,
6(1)93,
6(2)223,
6(3)233,
6(3)317,
7(1)79,
7(1)99,
7(3)273,
8(2)189,
8(2)203,
8(2)227,
8(2)239,
8(2)255,
9(1)17,
9(1)83,
9(1)127
- function,
1(1)13,
1(1)21,
1(2)161,
1(3)193,
1(4)289,
2(1)45,
2(1)73,
2(2)133,
2(2)228,
2(2)249,
2(3)345,
2(3)383,
2(3)397,
3(2)225,
3(3)283,
4(1)47,
5(3)257,
5(3)325,
6(2)109,
6(3)233,
6(3)317,
7(3)325,
8(1)57,
8(2)189,
9(1)83,
9(1)127,
9(1)147,
9(2)243
- polynomial,
1(1)21,
1(3)215,
1(3)227,
1(4)269,
2(1)73,
2(3)305,
3(1)1,
3(1)23,
3(1)105,
3(2)267,
3(3)349,
5(1)51,
6(1)93,
6(3)317,
7(2)185,
7(3)251,
7(3)273,
8(2)177,
8(2)189,
8(3)359,
9(1)67,
9(1)147
- programming,
1(1)13,
1(1)21,
1(2)125,
1(3)193,
1(3)215,
1(4)269,
1(4)289,
2(1)73,
2(2)133,
2(2)183,
2(2)228,
3(2)267,
3(3)349,
4(1)1,
4(1)59,
4(2)155,
4(2)171,
5(1)25,
5(2)113,
5(2)135,
5(2)205,
5(3)223,
5(3)275,
6(1)41,
6(1)93,
6(2)109,
6(2)223,
6(3)233,
6(3)281,
6(3)317,
7(1)79,
7(1)99,
7(3)239,
7(3)273,
8(1)57,
8(1)73,
8(3)325,
8(3)379,
9(1)39,
9(1)83,
9(1)127,
9(2)153,
9(2)243,
9(2)265,
9(2)329,
9(2)347
- recursive,
1(3)193,
2(1)45,
2(2)133,
2(2)155,
2(3)345,
3(1)61,
3(2)225,
5(3)257,
6(2)109,
6(3)233,
6(3)255,
6(3)317,
7(1)25,
8(1)73,
8(2)177,
9(1)39,
9(1)73,
9(2)243
- reducibility,
6(1)25
- Selman, A. L.,
8(2)177
- table,
4(1)77
- time,
1(3)215,
1(4)269,
3(1)1,
3(1)23,
3(1)61,
3(1)105,
3(3)305,
6(1)93,
7(2)149,
7(2)185,
7(3)273,
8(1)45,
8(2)189,
8(2)239
- Turing,
1(1)77,
1(3)215,
2(1)73,
3(2)213,
6(1)1,
6(1)25,
6(2)175,
7(2)185,
8(2)227,
8(2)239,
9(1)127,
9(2)311