Generalization of the subset sum problem and cubic forms

Recommendations

Cube sum problem and an explicit Gross-Zagier formula
Generalized binomial coefficients and the subset-subspace problem
On the Representation of a Binary Cubic Form as a Sum of Cubes
On variations of the subset sum problem
scientific article; zbMATH DE number 7673604
On expressing a cubic form as a sum of cubes of linear forms
scientific article; zbMATH DE number 7688183
Subset sum ``cubes and the complexity of primality testing
A generalization of sumset and its applications
On the subset sum problem over finite fields

Cites work

A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
A note on a P NP result for a restricted class of real machines
A randomized heuristic repair for the multidimensional knapsack problem
A refined branching algorithm for the maximum satisfiability problem
Binary solutions to large systems of linear equations
Calculation of the characteristic polynomial of a matrix
Complexity of Positivstellensatz proofs for the knapsack
Computing over the reals with addition and order
Computing Partitions with Applications to the Knapsack Problem
Extended launch pad method for the Pareto frontier approximation in multiextremal multiobjective optimization problems
Fast matrix rank algorithms and applications
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Faster Pseudopolynomial Time Algorithms for Subset Sum
Fields of algebraic numbers computable in polynomial time. I
Heuristic algorithms for recognition of some cubic hypersurfaces
scientific article; zbMATH DE number 808811 (Why is no real title available?)
scientific article; zbMATH DE number 855574 (Why is no real title available?)
Improved low-density subset sum algorithms
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
Magic sets for polynomials of degree n
Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
On binary solutions to systems of equations
On digital nondeterminism
On generic complexity of the subset sum problem for semigroups of integer matrices
On lattice point counting in -modular polyhedra
On the complexity of Hilbert refutations for partition
Parameterization of the discriminant set of a polynomial
Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
Solving low-density subset sum problems

Cited in

(2)

Cube sum problem and an explicit Gross-Zagier formula
Lower bounds for the rank of a matrix with zeros and ones outside the leading diagonal

This page was built for publication: Generalization of the subset sum problem and cubic forms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039136)