Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795): Difference between revisions

@@ aliases / en / 0 / aliases / en / 0 @@
+Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6195434
@@ Property / title @@
+Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68116
@@ Property / zbMATH Open document ID: 1327.68116 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-39206-1_26
@@ Property / DOI: 10.1007/978-3-642-39206-1_26 / rank @@
+Normal rank
@@ Property / published in @@
+Automata, Languages, and Programming
@@ Property / published in: Automata, Languages, and Programming / rank @@
+Normal rank
@@ Property / publication date @@
+August 2013Timestamp +2013-08-06T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-08-06T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 6 August 2013 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6195434
@@ Property / zbMATH DE Number: 6195434 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Wolfram Functions Site
@@ Property / describes a project that uses: Wolfram Functions Site / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2138096767
@@ Property / OpenAlex ID: W2138096767 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2104038652
@@ Property / OpenAlex ID: W2104038652 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6191
@@ Property / arXiv ID: 1302.6191 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds for the collision and the element distinctness problems
+Normal rank
@@ Property / cites work @@
+Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+Q3002756
@@ Property / cites work: Q3002756 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum lower bounds by polynomials
@@ Property / cites work: Quantum lower bounds by polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+Q2906797
@@ Property / cites work: Q2906797 / rank @@
+Normal rank
@@ Property / cites work @@
+Perceptrons, PP, and the polynomial hierarchy
@@ Property / cites work: Perceptrons, PP, and the polynomial hierarchy / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
+Normal rank
@@ Property / cites work @@
+Isometries on L p,1
@@ Property / cites work: Isometries on L p,1 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002823
@@ Property / cites work: Q3002823 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4449183
@@ Property / cites work: Q4449183 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3284008
@@ Property / cites work: Q3284008 / rank @@
+Normal rank
@@ Property / cites work @@
+Agnostically Learning Halfspaces
@@ Property / cites work: Agnostically Learning Halfspaces / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
+Normal rank
@@ Property / cites work @@
+Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
+Normal rank
@@ Property / cites work @@
+Lower bounds for agnostic learning via approximate rank
+Normal rank
@@ Property / cites work @@
+Q5595902
@@ Property / cites work: Q5595902 / rank @@
+Normal rank
@@ Property / cites work @@
+On the degree of Boolean functions as real polynomials
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate inclusion-exclusion for arbitrary symmetric functions
+Normal rank
@@ Property / cites work @@
+Q3191590
@@ Property / cites work: Q3191590 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3396635
@@ Property / cites work: Q3396635 / rank @@
+Normal rank
@@ Property / cites work @@
+Making polynomials robust to noise
@@ Property / cites work: Making polynomials robust to noise / rank @@
+Normal rank
@@ Property / cites work @@
+Separating ${AC}^0$ from Depth-2 Majority Circuits
+Normal rank
@@ Property / cites work @@
+The Intersection of Two Halfspaces Has High Threshold Degree
+Normal rank
@@ Property / cites work @@
+The multiparty communication complexity of set disjointness
+Normal rank
@@ Property / cites work @@
+The Pattern Matrix Method
@@ Property / cites work: The Pattern Matrix Method / rank @@
+Normal rank
@@ Property / cites work @@
+Q3633949
@@ Property / cites work: Q3633949 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2347795

Latest revision as of 04:21, 10 July 2024

scientific article; zbMATH DE number 6195434

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities

Language	Label	Description	Also known as
English	Dual lower bounds for approximate degree and Markov-Bernstein inequalities	scientific article; zbMATH DE number 6195434	Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities