Fault detection tests for stuck-at faults on parity counter inputs (Q895069): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3268318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easily tested circuits for linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved non-approximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity testing in characteristic two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2) / rank
 
Normal rank

Latest revision as of 02:49, 11 July 2024

scientific article
Language Label Description Also known as
English
Fault detection tests for stuck-at faults on parity counter inputs
scientific article

    Statements

    Fault detection tests for stuck-at faults on parity counter inputs (English)
    0 references
    26 November 2015
    0 references
    Boolean function
    0 references
    test for circuit inputs
    0 references
    linear Boolean function
    0 references
    parity counter
    0 references
    0 references

    Identifiers