Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00493-011-2537-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104644213 / 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: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monomial Ideal Membership Problem and Polynomial Identity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Randomness via Irrational Numbers / 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: Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic extractors for affine sources over large fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation 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: Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some approximation problems concerning sparse polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blackbox Polynomial Identity Testing for Depth 3 Circuits / 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: Randomness efficient identity testing of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching is as easy as matrix inversion / 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: An Almost Optimal Rank Bound for Depth-3 Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning sparse multivariate polynomials over a field with queries and counterexamples. / 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: Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Polynomial Identity Testing for Read-Once Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of sparse polynomial interpolation over finite fields / rank
 
Normal rank

Latest revision as of 19:13, 4 July 2024

scientific article
Language Label Description Also known as
English
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
scientific article

    Statements

    Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (English)
    0 references
    0 references
    0 references
    20 December 2011
    0 references
    0 references
    identity testing algorithm
    0 references
    arithmetic circuits
    0 references
    0 references
    0 references
    0 references