A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (Q6045460): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.46298/dmtcs.9877 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4041090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some classes of polynomials with nonnegative coefficients and a given factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of polynomials with integral non-negative coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for diophantine equations in one variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Cayley multigraphs over abelian and Hamiltonian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting of regular hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating multidimensional subset sum and Minkowski decomposition of polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of polytopes and polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-degree factors of lacunary multivariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards tractable algebras for bags / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials and the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of factoring bivariate supersparse (Lacunary) polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complex polynomials and polynomial reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3510307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors of disconnected graphs and polynomials with nonnegative integer coefficients / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.46298/DMTCS.9877 / rank
 
Normal rank

Latest revision as of 17:59, 30 December 2024

scientific article; zbMATH DE number 7689925
Language Label Description Also known as
English
A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum
scientific article; zbMATH DE number 7689925

    Statements

    A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum (English)
    0 references
    0 references
    31 May 2023
    0 references
    multisets
    0 references
    polynomials
    0 references
    decomposition
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers