Entry Tarui:1993:PPF 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{Tarui:1993:PPF,
author = "Jun Tarui",
title = "Probabilistic polynomials, {$AC^{0}$} functions, and
the polynomial-time hierarchly",
journal = j-THEOR-COMP-SCI,
volume = "113",
number = "1",
pages = "167--183",
day = "24",
month = may,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:13 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=113&issue=1;
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=1993&volume=113&issue=1&aid=1394",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory)",
corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "AC/sup 0/ functions; Boolean function; Boolean
functions; depth-three deterministic circuits;
polynomial-time hierarchy; polynomials; probabilistic
polynomials; threshold gate; Turing machines",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- boolean,
70(2)251,
74(3)313,
76(2)261,
79(1)25,
80(1)53,
80(1)77,
81(1)117,
81(2)257,
82(1)113,
82(1)141,
84(2)199,
88(1)139,
91(1)71,
93(2)227,
93(2)303,
97(2)285,
98(2)289,
99(2)243,
100(1)137,
101(1)133,
102(2)307,
103(1)25,
107(1)121,
108(2)271,
112(2)291,
115(1)77,
116(2)399,
116(2)415,
118(2)167,
121(1)9,
121(1)411,
124(2)273,
126(1)3,
126(2)183,
126(2)237,
133(1)35,
134(1)51,
134(1)79,
135(1)139,
136(2)419,
182(1)257
- circuit,
78(2)357,
79(1)25,
81(2)257,
82(1)85,
82(1)157,
84(2)225,
85(1)155,
86(2)343,
90(1)235,
93(2)185,
93(2)303,
95(2)207,
97(2)285,
98(2)289,
99(2)213,
100(1)253,
101(1)133,
102(2)215,
102(2)307,
107(1)77,
107(1)95,
107(1)121,
112(2)291,
116(2)415,
123(2)389,
125(2)295,
130(1)203,
132(1)347
- gate,
85(1)155,
86(2)343,
93(2)303,
97(2)285,
102(2)307,
107(1)63,
130(1)203,
133(1)23
- hierarchy,
73(3)313,
80(2)203,
81(1)77,
83(1)97,
83(2)313,
83(2)323,
84(2)199,
85(2)305,
88(2)297,
91(1)71,
95(1)97,
96(2)325,
96(2)345,
97(2)183,
98(2)249,
98(2)289,
100(1)45,
101(2)289,
102(2)215,
104(2)235,
106(2)283,
112(2)339,
112(2)413,
115(2)225,
115(2)261,
116(1)33,
119(2)293,
120(2)293,
123(2)239,
125(2)355,
127(1)123,
129(2)323,
132(1)1,
134(2)263,
134(2)287
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- probabilistic,
79(1)37,
81(1)65,
85(2)305,
88(1)1,
92(2)249,
93(2)201,
93(2)265,
106(2)395,
116(2)373,
123(1)131,
125(1)17
- threshold,
85(1)155,
93(2)303,
95(2)187,
100(1)253,
103(1)3,
107(1)63
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473