Cancellation-free circuits in unbounded and bounded depth (Q2348031): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.10.014 / 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: Q3115280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproving the Single Level Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Linear Boolean Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of the Mobius transformation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Boolean sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On another Boolean matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the monotone network complexity of Boolean sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Circuits over $\operatorname{GF}(2)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Very Compact S-Box for AES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474178 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.10.014 / rank
 
Normal rank

Latest revision as of 03:13, 18 December 2024

scientific article
Language Label Description Also known as
English
Cancellation-free circuits in unbounded and bounded depth
scientific article

    Statements

    Cancellation-free circuits in unbounded and bounded depth (English)
    0 references
    0 references
    0 references
    10 June 2015
    0 references
    circuit complexity
    0 references
    cancellation-free
    0 references
    linear circuits
    0 references

    Identifiers