Entry Ganesan:1994:OWF from tcs1990.bib
Last update: Wed Sep 26 02:11:46 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{Ganesan:1994:OWF,
author = "K. Ganesan",
title = "One-way functions and the isomorphism conjecture",
journal = j-THEOR-COMP-SCI,
volume = "129",
number = "2",
pages = "309--321",
day = "04",
month = jul,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:14 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=129&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=129&issue=2&aid=1564",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Eng., Florida Atlantic
Univ., Boca Raton, FL, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complexity classes; computational complexity; EXP;
exponential-time complexity; functions; isomorphism
conjecture; k-completely creative sets; NEXP;
NP-complete problems; one-way functions; productive
functions; standard complete set",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- complete,
70(1)127,
70(2)233,
71(3)347,
72(2)265,
74(1)3,
75(1)85,
75(1)z,
75(3)357,
76(2)179,
80(2)203,
81(1)1,
83(2)337,
85(1)75,
87(1)1,
88(1)33,
88(1)83,
89(2)207,
91(1)101,
94(2)281,
96(2)305,
97(2)183,
98(1)27,
98(1)z,
100(2)365,
102(1)135,
104(2)263,
111(1)125,
111(1)z,
112(2)255,
114(1)63,
114(2)231,
118(2)167,
118(2)315,
119(1)127,
119(1)z,
120(1)83,
121(1)351,
122(1)97,
124(1)1,
130(1)203,
131(1)95,
131(2)311,
132(1)229,
133(2)205,
134(1)27,
136(2)487,
136(2)507
- complete, NP-,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- conjecture,
71(1)29,
81(1)155,
83(2)337,
88(2)365,
89(2)207,
95(2)187,
104(2)161,
117(1)199,
123(1)21,
132(1)427
- creative,
85(1)1
- EXP,
115(2)383
- exponential-time,
80(2)203,
81(1)137,
99(2)301,
113(1)55,
115(2)371,
134(2)287
- isomorphism,
79(2)275,
83(2)337,
95(2)263,
102(2)307,
111(1)3,
129(1)187,
135(1)5,
135(2)289,
135(2)361,
136(1)163
- NP-complete,
80(2)203,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- one-way,
81(1)155,
83(2)337,
84(1)23,
85(1)53,
85(1)135,
88(2)287,
96(2)305,
96(2)411,
108(2)393,
119(2)233,
127(2)395,
132(1)259
- standard,
82(2)373,
83(2)237,
96(1)73,
102(2)329,
108(1)151,
108(2)331,
117(1)187,
117(1)243,
117(1)255,
120(2)197,
129(2)407,
130(1)17
- time, exponential-,
80(2)203,
81(1)137,
99(2)301,
113(1)55,
115(2)371,
134(2)287
- way, One-,
81(1)155,
132(1)259
- way, one-,
81(1)155,
83(2)337,
84(1)23,
85(1)53,
85(1)135,
88(2)287,
96(2)305,
96(2)411,
108(2)393,
119(2)233,
127(2)395,
132(1)259