Entry Reischuk:1991:RCN from focs1990.bib
Last update: Thu Sep 27 02:15:07 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
@InProceedings{Reischuk:1991:RCN,
author = "R. Reischuk and B. Schmeltz",
title = "Reliable computation with noisy circuits and decision
trees --- a general $n \log n$ lower bound",
crossref = "IEEE:1991:PAS",
pages = "602--611",
year = "1991",
bibdate = "Thu Apr 5 06:13:50 MDT 2001",
bibsource = "http://www.math.utah.edu/pub/tex/bib/focs1990.bib",
acknowledgement = ack-nhfb,
}
Related entries
- bound,
0(0)16,
0(0)36,
0(0)45,
0(0)51,
0(0)60,
0(0)114,
0(0)124,
0(0)141,
0(0)156,
0(0)166,
0(0)194,
0(0)197,
0(0)206,
0(0)218,
0(0)226,
0(0)228,
0(0)249,
0(0)253,
0(0)258,
0(0)269,
0(0)274,
0(0)279,
0(0)282,
0(0)288,
0(0)302,
0(0)314,
0(0)334,
0(0)347,
0(0)352,
0(0)352,
0(0)358,
0(0)369,
0(0)378,
0(0)382,
0(0)438,
0(0)462,
0(0)472,
0(0)484,
0(0)498,
0(0)524,
0(0)528,
0(0)548,
0(0)560,
0(0)585,
0(0)592,
0(0)594,
0(0)594,
0(0)600,
0(0)612,
0(0)622,
0(0)628,
0(0)648,
0(0)674,
0(0)674,
0(0)680,
0(0)684,
0(0)692,
0(0)752,
0(0)777,
0(0)794,
1(0)76,
1(0)285,
2(0)628,
2(0)672,
2(0)766
- circuit,
0(0)16,
0(0)124,
0(0)249,
0(0)269,
0(0)278,
0(0)279,
0(0)319,
0(0)332,
0(0)352,
0(0)412,
0(0)458,
0(0)553,
0(0)594,
0(0)595,
0(0)767,
0(0)777,
0(0)783,
1(0)193,
1(0)264,
1(0)397,
2(0)610,
2(0)619,
2(0)628,
2(0)642
- computation,
0(0)2,
0(0)2,
0(0)56,
0(0)104,
0(0)116,
0(0)124,
0(0)154,
0(0)288,
0(0)356,
0(0)447,
0(0)478,
0(0)504,
0(0)508,
0(0)534,
0(0)548,
0(0)553,
0(0)725,
1(0)335,
2(0)758
- decision,
0(0)38,
0(0)258,
0(0)268,
0(0)304,
0(0)318,
0(0)576,
2(0)662
- efficient,
0(0)42,
0(0)123,
0(0)143,
0(0)144,
0(0)160,
0(0)234,
0(0)271,
0(0)309,
0(0)320,
0(0)332,
0(0)363,
0(0)384,
0(0)457,
0(0)458,
0(0)470,
0(0)508,
0(0)533,
0(0)548,
0(0)583,
0(0)656,
0(0)678,
0(0)704,
0(0)714,
0(0)758,
1(0)173,
1(0)382
- general,
0(0)79,
0(0)130,
0(0)282,
0(0)294,
0(0)390,
0(0)405,
0(0)436,
2(0)534
- Kumar, S. R.,
0(0)592
- linear,
0(0)12,
0(0)38,
0(0)40,
0(0)135,
0(0)190,
0(0)274,
0(0)296,
0(0)319,
0(0)330,
0(0)330,
0(0)359,
0(0)475,
0(0)488,
0(0)512,
0(0)548,
0(0)554,
0(0)557,
0(0)596,
0(0)617,
0(0)670,
0(0)704,
0(0)714,
0(0)724,
1(0)220,
2(0)574,
2(0)583,
2(0)662
- lower,
0(0)16,
0(0)45,
0(0)60,
0(0)124,
0(0)206,
0(0)226,
0(0)228,
0(0)249,
0(0)253,
0(0)258,
0(0)269,
0(0)274,
0(0)279,
0(0)288,
0(0)302,
0(0)334,
0(0)352,
0(0)352,
0(0)369,
0(0)374,
0(0)378,
0(0)438,
0(0)472,
0(0)484,
0(0)498,
0(0)528,
0(0)548,
0(0)594,
0(0)594,
0(0)612,
0(0)622,
0(0)648,
0(0)674,
0(0)674,
0(0)692,
0(0)777,
0(0)794,
1(0)76,
2(0)628
- noisy,
0(0)294,
0(0)330,
0(0)514,
0(0)594,
0(0)594
- recurrence,
0(0)716
- reliable,
0(0)90,
0(0)332,
0(0)594
- Sivakumar, D.,
0(0)26,
0(0)362,
0(0)595
- tree,
0(0)22,
0(0)42,
0(0)80,
0(0)84,
0(0)118,
0(0)137,
0(0)174,
0(0)180,
0(0)216,
0(0)224,
0(0)258,
0(0)268,
0(0)302,
0(0)304,
0(0)318,
0(0)368,
0(0)379,
0(0)396,
0(0)399,
0(0)431,
0(0)436,
0(0)480,
0(0)534,
0(0)536,
0(0)548,
0(0)548,
0(0)576,
0(0)596,
0(0)631,
0(0)632,
0(0)659,
0(0)716,
0(0)770,
1(0)145,
2(0)719