Q5002654 (Q5002654): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobian hits circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning read-once formulas with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic independence and blackbox identity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interpolating arithmetic read-once formulas with exponentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolating Arithmetic Read-Once Formulas in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Boolean read-once formulas over generalized bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials whose powers are sparse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ideals, Varieties, and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5788419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic distinct-degree factorization of polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of depth-4 multilinear circuits with top fan-in 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes / 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: Q4660637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3255437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial characterization of read-once formulae / 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: Randomness efficient identity testing of multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A case of depth-3 identity testing, sparse factorization and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5497117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Read-once polynomial identity testing / 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: Decoding of Reed Solomon codes beyond the error-correction bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators without the XOR lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation can be exponentially powerful / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Arithmetic Read-Once Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring sparse multivariate polynomials / rank
 
Normal rank

Latest revision as of 06:42, 26 July 2024

scientific article; zbMATH DE number 7375853
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7375853

    Statements

    0 references
    28 July 2021
    0 references
    derandomization
    0 references
    arithmetic circuits
    0 references
    reconstruction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers