On binary solutions to systems of equations
From MaRDI portal
Recommendations
Cites work
- A faster pseudopolynomial time algorithm for subset sum
- A near-linear pseudopolynomial time algorithm for subset sum
- An approach to solving a Boolean linear equation with integer positive coefficients
- An improved balanced algorithm for the subset-sum problem
- Fast algorithms for knapsack via convolution and prediction
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Generating random permutations by coin tossing: classical algorithms, new analysis, and modern implementation
- Generic-case complexity, decision problems in group theory, and random walks.
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM
- On generic NP-completeness of the Boolean satisfiability problem
- On problems equivalent to \((\min,+)\)-convolution
- Relativized generic classes P and NP
- Space-efficient approximations for subset sum
Cited in
(9)- Binary vectors partially determined by linear equation systems
- Solving a binary puzzle
- Heuristic algorithms for recognition of some cubic hypersurfaces
- A binary algorithm for solving n by n systems of integer equations
- Solving Binary Linear Equation Systems over the Rationals and Binaries
- On binary differential equations and umbilics
- Binary solutions to large systems of linear equations
- Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
- Generalization of the subset sum problem and cubic forms
This page was built for publication: On binary solutions to systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151273)
