3 problems
- 0 votes0 replies0 views
The 3MIN threshold conjecture for reliable noisy computation
Let denote the threshold for reliable computation with noisy circuits of 3MIN gates, and let denote the threshold for reliable comput…
- 0 votes0 replies0 views
Reliable computation up to the transcritical bifurcation for odd fan-in and prime alphabets
Reliable-computation conjecture. Reliable computation is possible up to the transcritical bifurcation for all odd and prime .
- 0 votes0 replies0 views
Optimal processing functions for random DAG broadcasting
Consider the random DAG broadcasting model with fixed degree . Processing functions may be majority functions, alternating levels of AND and OR functions, or other Boolean funct…