On the minimum number of negations leading to super-polynomial savings (Q1029051): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Monotone versus positive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Negation-Limited Boolean Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4092993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Inversion Complexity of a System of Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone real circuits are more powerful than monotone Boolean circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Negations in Constant Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of negation-limited Boolean networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gap between monotone and non-monotone circuit complexity is exponential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation is Powerless for Boolean Slice Functions / rank
 
Normal rank

Latest revision as of 19:03, 1 July 2024

scientific article
Language Label Description Also known as
English
On the minimum number of negations leading to super-polynomial savings
scientific article

    Statements

    Identifiers