Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities-Reference-Cited by-同舟云学术

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities

Published:2013 Issue: Volume: Page:303-314
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Bun Mark,Thaler Justin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-39206-1_26

Reference34 articles.

1. Aaronson, S.: The polynomial method in quantum and classical computing. In: Proc. of Foundations of Computer Science (FOCS), p. 3 (2008), Slides available at http://www.scottaaronson.com/talks/polymeth.ppt

2. Aaronson, S., Shi, Y.: Quantum lower bounds for the collision and the element distinctness problems. Journal of the ACM 51(4), 595–605 (2004)

3. Ambainis, A.: Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range. Theory of Computing 1(1), 37–46 (2005)

4. Chattopadhyay, A., Ada, A.: Multiparty communication complexity of disjointness. Electronic Colloquium on Computational Complexity (ECCC) 15(002) (2008)

5. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bound by polynomials. Journal of the ACM 48(4), 778–797 (2001)

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approximate Degree, Weight, and Indistinguishability;ACM Transactions on Computation Theory;2022-03-04

2. Improved Bounds on Fourier Entropy and Min-entropy;ACM Transactions on Computation Theory;2021-12-31

3. Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

4. Lower Bounding the AND-OR Tree via Symmetrization;ACM Transactions on Computation Theory;2021-03

5. On Separation Between the Degree of a Boolean Function and the Block Sensitivity;Computer Science – Theory and Applications;2021