A case of depth-3 identity testing, sparse factorization and duality (Q1947039): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primality and identity testing via Chinese remaindering / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMES is in P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial identity testing for depth 3 circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness efficient identity testing of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two problems on arithmetic circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3891767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor-rank and lower bounds for arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic polynomial identity testing in non-commutative models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box identity testing of depth-4 multilinear circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal Circuit Identity Testing and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on Polynomial Identity Testing - II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blackbox identity testing for bounded top fanin depth-3 circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 09:13, 6 July 2024

scientific article
Language Label Description Also known as
English
A case of depth-3 identity testing, sparse factorization and duality
scientific article

    Statements

    A case of depth-3 identity testing, sparse factorization and duality (English)
    0 references
    0 references
    0 references
    0 references
    11 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    identity testing
    0 references
    arithmetic circuits
    0 references
    ideals
    0 references
    factorization
    0 references
    Galois rings
    0 references
    0 references