On probabilistic algorithm for solving almost all instances of the set partition problem
From MaRDI portal
Publication:2399381
DOI10.1007/978-3-319-58747-9_25zbMath1489.68373OpenAlexW2611661801MaRDI QIDQ2399381
Publication date: 22 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-58747-9_25
computational complexitysmoothnesspolynomialdiscriminantcubic hypersurfacesset partitiontangent line
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- Russell's hypersurface from a geometric point of view
- On the arithmetic complexity of Strassen-like matrix multiplications
- Cutting planes from extended LP formulations
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- Generic-case complexity, decision problems in group theory, and random walks.
- The multi-band robust knapsack problem -- a dynamic programming approach
- An improvement of the complexity bound for solving systems of polynomial equations
- Dimension-dependent bounds for Gröbner bases of polynomial ideals
- Affine solution sets of sparse polynomial systems
- On the complexity of Hilbert refutations for partition
- On the complexity of the \(F_5\) Gröbner basis algorithm
- A generic relation on recursively enumerable sets
- Length of the sum and product of algebraic numbers
- On the average number of steps of the simplex method of linear programming
- Triangular Decomposition of Matrices in a Domain
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- UNIRATIONALITY OF CUBIC HYPERSURFACES
- Gröbner–Shirshov bases and their calculation
- Most Tensor Problems Are NP-Hard
- On solutions and Waring’s formulas for systems of $n$ algebraic equations for $n$ unknowns
This page was built for publication: On probabilistic algorithm for solving almost all instances of the set partition problem
