A stronger LP bound for formula size lower bounds via clique constraints (Q428879): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions of positive self-dual Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum self-dual decompositions of positive dual-minor Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shrinkage Exponent of de Morgan Formulas is 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications of information complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Covers and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the realization of a linear function in the class of \(\Pi\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on Khrapchenko's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum adversary method and classical formula size power bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Rank Technique for Formula Size Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the noise sensitivity of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness amplification within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better lower bounds for monotone threshold formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of matrix methods to the theory of lower bounds in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short monotone formulae for the majority function / rank
 
Normal rank

Latest revision as of 10:00, 5 July 2024

scientific article
Language Label Description Also known as
English
A stronger LP bound for formula size lower bounds via clique constraints
scientific article

    Statements

    A stronger LP bound for formula size lower bounds via clique constraints (English)
    0 references
    0 references
    25 June 2012
    0 references
    formula size lower bound
    0 references
    linear programming
    0 references
    monotone self-dual Boolean function
    0 references
    stable set polytope
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers