Entry Ko:1986:OWF from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Ko:1986:OWF,
author = "Ker-I Ko and T. J. Long and D.-Z. Du",
title = "On one-way functions and polynomial-time
isomorphisms",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "3",
pages = "263--276",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability; computational complexity; equivalence
classes; exponential-time computable sets;
length-increasing polynomial-time reductions; one-one
polynomial-time reductions; one-way functions;
polynomial-time isomorphisms; polynomial-time
truth-table completeness; set equivalence; set theory",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
Related entries
- class,
35(1)17,
35(2)313,
37(2)123,
38(2)143,
38(2)157,
39(2)267,
40(1)57,
41(1)105,
42(2)123,
43(2)213,
44(2)237,
46(2)313,
47(1)1,
47(1)39,
47(1)71,
47(1)99,
47(2)111,
47(2)131,
47(3)247,
48(2)145,
48(2)329,
52(3)177,
52(3)251,
54(1)87,
58(1)129,
60(3)255,
61(1)17,
61(2)103,
63(1)43,
64(2)203,
67(1)75,
67(1)99,
67(2)143,
67(2)283,
68(2)155
- completeness,
35(2)345,
37(1)1,
39(2)135,
39(2)189,
44(2)127,
46(2)197,
47(1)1,
48(2)257,
54(2)249,
56(1)135,
56(3)289,
57(2)161,
58(1)155,
61(1)17,
63(1)43,
65(1)1,
65(1)35,
65(1)85,
65(3)343,
67(2)203,
68(3)277,
69(1)55,
69(3)289
- computability,
38(1)17,
38(1)35,
42(2)123,
43(2)251,
46(2)197,
47(3)299,
51(3)255,
51(3)265,
63(3)239,
66(2)117,
67(1)87,
68(3)267
- computable,
39(2)225,
43(2)251,
46(2)285,
47(2)131,
47(3)299,
50(2)137,
51(1)177,
54(2)341,
65(1)85,
66(2)117
- equivalence,
35(1)43,
35(2)313,
36(1)21,
36(1)113,
37(2)151,
37(2)183,
38(2)157,
39(1)27,
39(1)z,
41(1)105,
41(2)223,
42(1)1,
43(2)213,
44(2)237,
46(2)107,
46(2)175,
46(2)305,
47(1)39,
47(1)71,
47(3)247,
47(3)299,
48(2)145,
48(2)329,
49(2)185,
49(2)z,
50(3)241,
52(1)77,
52(3)177,
52(3)307,
53(1)67,
53(2)225,
58(1)183,
59(1)115,
63(1)19,
63(2)223,
64(1)39,
64(3)221,
66(1)1,
67(1)65
- isomorphism,
38(2)323,
39(2)207,
43(1)43,
63(3)295,
68(2)155
- Ko, Ker-I,
47(3)299
- Long, T. J.,
51(3)265
- one, one-,
38(2)157
- one-one,
38(2)157
- one-way,
39(2)89,
47(2)149,
48(2)153,
57(2)225,
68(1)19
- polynomial-time,
47(2)131,
51(3)265,
52(1)77,
56(3)289,
61(2)307,
68(3)267,
68(3)319
- reduction,
35(1)109,
37(2)123,
39(2)207,
41(1)81,
41(1)113,
41(2)289,
45(1)1,
51(1)215,
53(1)125,
53(2)201,
54(1)65,
54(2)249,
55(1)47,
56(1)17,
58(1)175,
58(1)325,
65(3)271,
68(3)267,
68(3)319
- time, polynomial-,
47(2)131,
51(3)265,
52(1)77,
56(3)289,
61(2)307,
68(3)267,
68(3)319
- way, one-,
39(2)89,
47(2)149,
48(2)153,
57(2)225,
68(1)19