Entry Goldreich:1998:CIA 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{Goldreich:1998:CIA,
author = "Oded Goldreich and Bernd Meyer",
title = "Computational indistinguishability: algorithms vs.
circuits",
journal = j-THEOR-COMP-SCI,
volume = "191",
number = "1--2",
pages = "215--218",
day = "30",
month = jan,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:31 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=191&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/191/1-2/2698.pdf",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240C (Computational
complexity)",
corpsource = "Dept. of Comput. Sci. and Appl. Math., Weizmann Inst.
of Sci., Rehovot, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "circuit complexity; complexity class; complexity
theory; computational complexity; computational
indistinguishability; probabilistic polynomial-time
algorithms; probability ensemble; probability
ensembles; proof of existence; randomised algorithms;
recursive computation; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- circuit,
137(1)109,
137(2)279,
141(1)283,
143(2)335,
148(1)33,
154(1)23,
156(1)99,
157(1)91,
158(1)193,
161(1)141,
162(1)133,
163(1)283,
174(1)137,
180(1)325,
182(1)171,
188(1)117,
191(1)97,
197(1)57,
197(1)171,
209(1)47,
209(1)389
- class,
139(1)187,
140(1)179,
140(2)291,
141(1)175,
143(1)149,
144(1)251,
145(1)111,
148(2)207,
149(2)201,
149(2)299,
150(1)1,
151(2)385,
152(1)67,
152(2)251,
153(1)49,
154(1)23,
154(2)145,
154(2)307,
154(2)367,
155(1)111,
155(1)141,
155(2)447,
157(2)227,
158(1)193,
158(1)221,
158(1)361,
160(1)305,
161(1)263,
161(1)301,
161(1)307,
162(1)5,
163(1)245,
163(1)283,
164(1)287,
165(2)355,
167(1)171,
170(1)407,
172(1)43,
172(1)91,
174(1)67,
174(1)231,
174(1)269,
176(1)39,
176(1)205,
177(1)59,
177(1)139,
178(1)37,
179(1)217,
180(1)139,
180(1)155,
180(1)217,
180(1)325,
183(1)93,
185(1)159,
185(1)177,
186(1)231,
188(1)79,
188(1)101,
190(1)87,
194(1)137,
194(1)246,
195(1)33,
195(2)113,
195(2)183,
195(2)205,
197(1)247,
198(1)225,
203(1)123,
207(1)217,
209(1)225,
211(1)253,
226(1)29,
234(1)323
- existence,
145(1)71,
146(1)311,
194(1)240-1
- indistinguishability,
139(1)275
- 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,
148(2)325,
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,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- probabilistic,
138(2)315,
143(1)23,
143(1)73,
144(1)3,
144(1)161,
144(1)221,
145(1)391,
152(2)219,
156(1)99,
157(2)139,
157(2)161,
157(2)259,
158(1)53,
159(1)65,
159(1)81,
171(1)147,
171(1)179,
176(1)1,
177(1)111,
178(1)155,
180(1)217,
181(1)45,
185(1)81,
190(2)151,
190(2)211,
193(1)53,
207(1)117,
221(1)271
- probability,
138(2)315,
144(1)125,
144(1)161,
144(1)221,
147(1)267,
148(1)19,
148(1)133,
149(1)67,
152(2)219,
155(1)141,
155(2)349,
156(1)39,
156(1)315,
157(2)277,
159(1)65,
159(1)81,
164(1)107,
171(1)147,
172(1)43,
174(1)193,
176(1)1,
181(1)45,
184(1)237,
188(1)1,
193(1)53,
202(1)1,
207(1)245,
219(1)421,
254(1)691
- proof,
135(1)67,
138(1)113,
138(2)243,
139(1)355,
140(1)95,
141(1)69,
150(1)161,
151(1)3,
151(2)487,
152(2)219,
153(1)49,
155(2)439,
165(1)3,
165(1)75,
165(1)171,
166(1)1,
166(1)173,
166(1)291,
167(1)171,
169(1)3,
170(1)1,
170(1)129,
170(1)407,
173(2)311,
173(2)393,
175(1)29,
175(1)159,
176(1)159,
176(1)283,
177(2)487,
178(1)257,
179(1)103,
179(1)137,
179(1)333,
180(1)309,
180(1)371,
181(2)317,
183(2)253,
184(1)1,
185(2)319,
188(1)211,
189(1)71,
190(1)41,
191(1)37,
193(1)53,
194(1)244-3,
194(1)247-2,
194(1)z,
197(1)242-3,
197(1)245-1,
197(1)245-2,
197(1)246-1,
197(1)246-2,
197(1)247-2,
198(1)201,
206(1)257,
206(1)331,
206(1)353,
212(1)141,
215(1)329,
216(1)271,
216(1)395,
227(1)299,
227(1)333
- randomised,
148(1)133,
154(1)23,
154(2)225,
157(1)35,
158(1)53,
169(2)147,
180(1)17,
181(1)45,
182(1)233,
194(1)163,
196(1)181
- recursive,
139(1)315,
139(1)355,
141(1)151,
143(2)251,
144(1)221,
146(1)69,
146(1)243,
146(1)269,
147(1)19,
149(1)101,
151(1)207,
152(1)1,
152(2)285,
154(2)307,
156(1)177,
161(1)123,
161(1)235,
162(1)5,
162(1)23,
162(1)45,
163(1)269,
163(1)309,
164(1)13,
165(2)325,
169(1)113,
170(1)349,
175(1)127,
176(1)205,
181(1)45,
181(1)119,
181(1)141,
185(1)129,
190(1)61,
191(1)145,
193(1)113,
193(1)129,
194(1)241,
197(1)139,
201(1)63,
208(1)33,
210(1)99,
219(1)3
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
172(1)209,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
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,
148(2)325,
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,
192(2)315,
194(1)137,
197(1)79,
210(1)217,
217(1)3,
411(31)2999
- vs.,
175(1)15,
200(1)45