scientific article; zbMATH DE number 5485570
From MaRDI portal
Publication:5302081
zbMath1231.94096MaRDI QIDQ5302081
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Improved Parameterized Algorithms for above Average Constraint Satisfaction ⋮ Making the Long Code Shorter ⋮ On the Fourier transform of a quantitative trait: implications for compressive sensing ⋮ The relative exponential time complexity of approximate counting satisfying assignments ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Collapse of the hierarchy of constant-depth exact quantum circuits ⋮ Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments ⋮ Half-Spaces with Influential Variable ⋮ On the Fourier spectrum of functions on Boolean cubes ⋮ A quantum algorithm to approximate the linear structures of Boolean functions ⋮ A probabilistic approach to problems parameterized above or below tight bounds ⋮ Approximately classic judgement aggregation ⋮ On the resolution of the sensitivity conjecture ⋮ Solving MAX-\(r\)-SAT above a tight lower bound ⋮ Optimal collapsing protocol for multiparty pointer jumping ⋮ On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field ⋮ Geometric influences. II: Correlation inequalities and noise sensitivity ⋮ How low can approximate degree and quantum query complexity be for total Boolean functions? ⋮ The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions ⋮ Property testing lower bounds via communication complexity ⋮ Unnamed Item ⋮ Bohr's phenomenon for functions on the Boolean cube ⋮ On extremal \(k\)-CNF formulas ⋮ Variable Influences in Conjunctive Normal Forms ⋮ The Quest for Strong Inapproximability Results with Perfect Completeness ⋮ Unnamed Item ⋮ Exponentially improved algorithms and lower bounds for testing signed majorities ⋮ A quantum algorithm for approximating the influences of Boolean functions and its applications
This page was built for publication:
