Separating OR, SUM, and XOR circuits (Q269494): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cancellation-Free Circuits in Unbounded and Bounded Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic minimization techniques with applications to cryptology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Satisfiability of Small Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3115280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Efficient Circuits for Ensemble Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Linear Boolean Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Norm-graphs and bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Boolean sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On another Boolean matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Evaluation of Powers and Monomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank

Revision as of 19:17, 11 July 2024

scientific article
Language Label Description Also known as
English
Separating OR, SUM, and XOR circuits
scientific article

    Statements

    Separating OR, SUM, and XOR circuits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    arithmetic circuits
    0 references
    Boolean arithmetic
    0 references
    idempotent arithmetic
    0 references
    monotone separations
    0 references
    rewriting
    0 references

    Identifiers