The Intersection of Two Halfspaces Has High Threshold Degree
From MaRDI portal
Publication:5171185
DOI10.1109/FOCS.2009.18zbMath1292.68100MaRDI QIDQ5171185
Publication date: 25 July 2014
Published in: 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits ⋮ A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ Optimal bounds for sign-representing the intersection of two halfspaces by polynomials ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Dual lower bounds for approximate degree and Markov-Bernstein inequalities
This page was built for publication: The Intersection of Two Halfspaces Has High Threshold Degree
