Noisy Computing of the Threshold Function
- 1 October 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (10) , 7686-7708
Abstract
No abstract availableFunding Information
- Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery (RGPIN-2019-05448)
- NSERC Collaborative Research and Development (CRDPJ 54367619)
- NSERC (CPRA-609642-2026)
- National Science Foundation (IIS-1901252)
This publication has 19 references indexed in Scilit:
- Noisy Sorting CapacityIEEE Transactions on Information Theory, 2024
- Noisy Computing of the OR and MAX FunctionsIEEE Journal on Selected Areas in Information Theory, 2024
- Reliable computation with noisy circuits and decision trees-a general n log n lower bound2002
- Gambling in a rigged casino: The adversarial multi-armed bandit problem2002
- Assouad, Fano, and Le Cam1997
- Lower bounds for the complexity of reliable Boolean circuits with noisy gatesIEEE Transactions on Information Theory, 1994
- On a lower bound for the redundancy of reliable networks with noisy gatesIEEE Transactions on Information Theory, 1991
- Searching with known error probabilityTheoretical Computer Science, 1989
- Estimation des densit s: risque minimaxProbability Theory and Related Fields, 1979
- Sequential transmission using noiseless feedbackIEEE Transactions on Information Theory, 1963