Can large fanin circuits perform reliable computations in the presence of faults? (Q1575437): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4385519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for the complexity of reliable Boolean circuits with noisy gates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Majority gates vs. general weighted threshold gates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simulating threshold circuits by majority circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Threshold circuits of bounded depth / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Invariance of complexity measures for networks with unreliable gates / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Area efficient methods to increase the reliability of combinatorial circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3762226 / rank | |||
Normal rank |
Revision as of 13:12, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Can large fanin circuits perform reliable computations in the presence of faults? |
scientific article |
Statements
Can large fanin circuits perform reliable computations in the presence of faults? (English)
0 references
21 August 2000
0 references
unbounded fanin circuits
0 references