ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS

DOI10.17223/20710410/45/3zbMath1458.68287OpenAlexW2986940674MaRDI QIDQ5151273

A. V. Seliverstov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm668

zbMATH Keywords

computational complexityprobabilistic algorithmalgebraic equation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Randomized algorithms (68W20)

Related Items

Generalization of the subset sum problem and cubic forms, Heuristic algorithms for recognition of some cubic hypersurfaces

Cites Work

• Unnamed Item
• Generic-case complexity, decision problems in group theory, and random walks.
• An improved balanced algorithm for the subset-sum problem
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• An approach to solving a Boolean linear equation with integer positive coefficients
• A Faster Pseudopolynomial Time Algorithm for Subset Sum
• A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
• On Problems Equivalent to (min,+)-Convolution
• Generating Random Permutations by Coin Tossing
• Space-Efficient Approximations for Subset Sum
• ON GENERIC NP-COMPLETENESS OF THE BOOLEAN SATISFIABILITY PROBLEM
• ON GENERIC COMPLEXITY OF DECIDABILITY PROBLEM FOR DIOPHANTINE SYSTEMS IN THE SKOLEM’S FORM
• RELATIVIZED GENERIC CLASSES P AND NP
• Fast algorithms for knapsack via convolution and prediction