Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393): Difference between revisions

Latest revision as of 07:09, 6 July 2024

scientific article; zbMATH DE number 5834108

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

Language	Label	Description	Also known as
English	Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials	scientific article; zbMATH DE number 5834108	Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials

Statements

instance of

scholarly article

0 references

title

Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (English)

0 references

Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials (English)

0 references

0 references

0 references

Journal of Combinatorial Optimization

0 references

Combinatorial Optimization and Applications

0 references

publication date

25 March 2013

0 references

8 January 2011

0 references

full work available at URL

https://arxiv.org/abs/1007.2678

0 references

zbMATH Keywords

multivariate polynomials

0 references

monomial testing

0 references

monomial coefficient computing

0 references

maximum multilinear monomials

0 references

approximation algorithms

0 references

inapproximability

0 references

monomial coefficients

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Primality and identity testing via Chinese remaindering

0 references

PRIMES is in P

0 references

Proof verification and the hardness of approximation problems

0 references

Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials

0 references

The Complexity of Testing Monomials in Multivariate Polynomials

0 references

Reducing Randomness via Irrational Numbers

0 references

The Approximability of the Exemplar Breakpoint Distance Problem

0 references

Q2934608

0 references

On the inapproximability of the exemplar conserved interval distance problem of genomes

0 references

Algorithms for Testing Monomials in Multivariate Polynomials

0 references

NP-completeness and APX-completeness of restrained domination in graphs

0 references

Interactive proofs and the hardness of approximating cliques

0 references

SeparatingPH fromPP by relativization

0 references

Some optimal inapproximability results

0 references

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

0 references

Derandomizing polynomial identity tests means proving circuit lower bounds

0 references

Learning DNF in time

0 references

Faster Algebraic Algorithms for Path and Packing Problems

0 references

Deterministic polynomial identity testing in non-commutative models

0 references

IP = PSPACE

0 references

The complexity of computing the permanent

0 references

Finding paths of length \(k\) in \(O^{*}(2^k)\) time

0 references

Q3002782

0 references

Identifiers

zbMATH Open document ID

1288.90072

0 references

1310.68237

0 references

DOI

10.1007/s10878-012-9496-5

0 references

10.1007/978-3-642-17458-2_26

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1944393

@@ Property / cites work @@
+Primality and identity testing via Chinese remaindering
+Normal rank
@@ Property / cites work @@
+PRIMES is in P
@@ Property / cites work: PRIMES is in P / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials
+Normal rank
@@ Property / cites work @@
+The Complexity of Testing Monomials in Multivariate Polynomials
+Normal rank
@@ Property / cites work @@
+Reducing Randomness via Irrational Numbers
@@ Property / cites work: Reducing Randomness via Irrational Numbers / rank @@
+Normal rank
@@ Property / cites work @@
+The Approximability of the Exemplar Breakpoint Distance Problem
+Normal rank
@@ Property / cites work @@
+Q2934608
@@ Property / cites work: Q2934608 / rank @@
+Normal rank
@@ Property / cites work @@
+On the inapproximability of the exemplar conserved interval distance problem of genomes
+Normal rank
@@ Property / cites work @@
+Algorithms for Testing Monomials in Multivariate Polynomials
+Normal rank
@@ Property / cites work @@
+NP-completeness and APX-completeness of restrained domination in graphs
+Normal rank
@@ Property / cites work @@
+Interactive proofs and the hardness of approximating cliques
+Normal rank
@@ Property / cites work @@
+SeparatingPH fromPP by relativization
@@ Property / cites work: SeparatingPH fromPP by relativization / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+Learning DNF in time
@@ Property / cites work: Learning DNF in time / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Deterministic polynomial identity testing in non-commutative models
+Normal rank
@@ Property / cites work @@
+IP = PSPACE
@@ Property / cites work: IP = PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank