On probabilistic algorithm for solving almost all instances of the set partition problem (Q2399381): 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/978-3-319-58747-9_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2611661801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Hilbert refutations for partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine solution sets of sparse polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes from extended LP formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-band robust knapsack problem -- a dynamic programming approach / 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: Generic-case complexity, decision problems in group theory, and random walks. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic relation on recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Tensor Problems Are NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement of the complexity bound for solving systems of polynomial equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solutions and Waring’s formulas for systems of $n$ algebraic equations for $n$ unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner–Shirshov bases and their calculation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the \(F_5\) Gröbner basis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension-dependent bounds for Gröbner bases of polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular Decomposition of Matrices in a Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average number of steps of the simplex method of linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length of the sum and product of algebraic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNIRATIONALITY OF CUBIC HYPERSURFACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the arithmetic complexity of Strassen-like matrix multiplications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Russell's hypersurface from a geometric point of view / rank
 
Normal rank

Latest revision as of 06:57, 14 July 2024

scientific article
Language Label Description Also known as
English
On probabilistic algorithm for solving almost all instances of the set partition problem
scientific article

    Statements

    On probabilistic algorithm for solving almost all instances of the set partition problem (English)
    0 references
    0 references
    22 August 2017
    0 references
    set partition
    0 references
    cubic hypersurfaces
    0 references
    smoothness
    0 references
    tangent line
    0 references
    polynomial
    0 references
    discriminant
    0 references
    computational complexity
    0 references
    0 references
    0 references

    Identifiers