On testing monomials in multivariate polynomials (Q391220): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Testing Monomials in Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Testing Monomials in Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: SeparatingPH fromPP by relativization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / 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: Learning DNF in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / 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: Algorithms for maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank

Latest revision as of 05:46, 7 July 2024

scientific article
Language Label Description Also known as
English
On testing monomials in multivariate polynomials
scientific article

    Statements

    On testing monomials in multivariate polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 January 2014
    0 references
    0 references
    algebra
    0 references
    complexity
    0 references
    multivariate polynomials
    0 references
    monomials
    0 references
    monomial testing
    0 references
    randomization
    0 references
    derandomization
    0 references
    0 references