Generalization of the subset sum problem and cubic forms
From MaRDI portal
Publication:6039136
DOI10.1134/s0965542523010116zbMath1518.90050OpenAlexW4362728139MaRDI QIDQ6039136
Publication date: 3 May 2023
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542523010116
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fields of algebraic numbers computable in polynomial time. I
- A randomized heuristic repair for the multidimensional knapsack problem
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- A note on a \(P \neq NP\) result for a restricted class of real machines
- Improved low-density subset sum algorithms
- Computing over the reals with addition and order
- Heuristic algorithms for recognition of some cubic hypersurfaces
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- A refined branching algorithm for the maximum satisfiability problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- On lattice point counting in \(\varDelta\)-modular polyhedra
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Magic sets for polynomials of degree \(n\)
- Extended launch pad method for the Pareto frontier approximation in multiextremal multiobjective optimization problems
- On the complexity of Hilbert refutations for partition
- Parameterization of the discriminant set of a polynomial
- Calculation of the characteristic polynomial of a matrix
- Solving low-density subset sum problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Computing Partitions with Applications to the Knapsack Problem
- On digital nondeterminism
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Binary solutions to large systems of linear equations
- ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS
- Fast matrix rank algorithms and applications
- Complexity of Positivstellensatz proofs for the knapsack
This page was built for publication: Generalization of the subset sum problem and cubic forms
