Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Nonclassical polynomials as a barrier to polynomial lower bounds.
Abhishek Bhowmick
,
Shachar Lovett
Type:
Article
Publication Date:
2014-01-01
Citations:
1
Share
Similar Works
Action
Title
Year
Authors
+
Nonclassical polynomials as a barrier to polynomial lower bounds
2014
Abhishek Bhowmick
Shachar Lovett
+
Nonclassical polynomials as a barrier to polynomial lower bounds
2015
Abhishek Bhowmick
Shachar Lovett
+
Nonclassical polynomials as a barrier to polynomial lower bounds
2014
Abhishek Bhowmick
Shachar Lovett
+
Random low-degree polynomials are hard to approximate
2011
Ido Ben‐Eliezer
Rani Hod
Shachar Lovett
+
PDF
Chat
Low-Degree Factors of Random Polynomials
2018
Sean O’Rourke
Philip Matchett Wood
+
Algorithmic polynomials
2018
Alexander A. Sherstov
+
Dimension-free estimates for low degree functions on the Hamming cube
2025
Komla Domelevo
Polona Durcik
Valentia Fragkiadaki
Ohad Klein
Diogo Oliveira e Silva
Lenka Slavíková
Błażej Wróbel
+
Noisy decoding by shallow circuits with parities: classical and quantum
2023
Jop Briët
Harry Buhrman
Davi Castro-Silva
Niels M. P. Neumann
+
PDF
Chat
Pseudorandom Generators for Polynomial Threshold Functions
2013
Raghu Meka
David Zuckerman
+
PDF
Chat
BQP and the polynomial hierarchy
2010
Scott Aaronson
+
Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
2024
Avantika Agarwal
Sevag Gharibian
Venkata Koppula
Dorian Rudolph
+
XOR Lemmas for Resilient Functions Against Polynomials.
2019
Eshan Chattopadhyay
Pooya Hatami
Kaave Hosseini
Shachar Lovett
David Zuckerman
+
Anti-concentration for polynomials of Rademacher random variables and applications in complexity theory
2015
Raghu Meka
Hoi H. Nguyen
Van Khu Vu
+
Anti-concentration for random polynomials.
2015
Hoi H. Nguyen
Van Vu
+
Dual polynomials and communication complexity of $\textsf{XOR}$ functions
2017
Arkadev Chattopadhyay
Nikhil S. Mande
+
Bias implies low rank for quartic polynomials
2019
Amichai Lampert
+
Approximate degree, secret sharing, and concentration phenomena
2019
Andrej Bogdanov
Nikhil S. Mande
Justin Thaler
Christopher Williamson
+
Polynomial degree vs. quantum query complexity
2003
Andris Ambainis
+
Random restrictions and PRGs for PTFs in Gaussian Space.
2021
Zander Kelley
Raghu Meka
+
PDF
Chat
None
2016
Raghu Meka
Hoi H. Nguyen
Van Khu Vu
Works That Cite This (0)
Action
Title
Year
Authors
Works Cited by This (0)
Action
Title
Year
Authors