The following pages link to (Q5302081):
Displaying 29 items.
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- Collapse of the hierarchy of constant-depth exact quantum circuits (Q347120) (← links)
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- Geometric influences. II: Correlation inequalities and noise sensitivity (Q479700) (← links)
- How low can approximate degree and quantum query complexity be for total Boolean functions? (Q488052) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Property testing lower bounds via communication complexity (Q693004) (← links)
- Bohr's phenomenon for functions on the Boolean cube (Q1788787) (← links)
- On the Fourier transform of a quantitative trait: implications for compressive sensing (Q2137407) (← links)
- Exponentially improved algorithms and lower bounds for testing signed majorities (Q2354020) (← links)
- A quantum algorithm for approximating the influences of Boolean functions and its applications (Q2355587) (← links)
- On the Fourier spectrum of functions on Boolean cubes (Q2423426) (← links)
- Approximately classic judgement aggregation (Q2436699) (← links)
- Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
- On extremal \(k\)-CNF formulas (Q2509734) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- (Q2857316) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)
- The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions (Q3012817) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- Variable Influences in Conjunctive Normal Forms (Q3637162) (← links)
- A quantum algorithm to approximate the linear structures of Boolean functions (Q4599610) (← links)
- The Quest for Strong Inapproximability Results with Perfect Completeness (Q5002604) (← links)
- Half-Spaces with Influential Variable (Q5107661) (← links)
- On the resolution of the sensitivity conjecture (Q5123060) (← links)
- (Q5743468) (← links)
