Author:
Aspnes J.,Beigel R.,Furst M.,Rudich S.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. R. Beigel: Relativized counting classes: Relations among thresholds, parity, and mods.Journal of Computer and System Sciences 42(1) February 1991, 76?96.
2. R. Beigel, N. Reingold, andD. Spielman: The perceptron strikes back.Proceedings of the 6th Annual Conference on Structure in Complexity Theory (1991), 286?291.
3. C. H. Bennett, andJ. Gill: Relative to a random oracleA, P A ?NP A ?co-NP A with probability 1.SIAM Journal on Computing 10(1) February 1981, 96?113.
4. J. Bruck: Harmonic analysis of polynomial threshold functions.SIAM Journal on Discrete Mathematics 3(2) May 1990, 168?177.
5. J. Bruck, andR. Smolensky: Polynomial threshold functions, AC0 functions and spectral norms. InProceedings of the 31st Annual Symposium on Foundations of Computer Science (1990), 632?641.
Cited by
93 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Detecting Low-Degree Truncation;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. The approximate degree of DNF and CNF formulas;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Approximate Degree in Classical and Quantum Computing;Foundations and Trends® in Theoretical Computer Science;2022
4. Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$;SIAM Journal on Computing;2021-08-20
5. The hardest halfspace;computational complexity;2021-08-03