Improved agreeing-gluing algorithm
From MaRDI portal
Publication:2254079
Recommendations
Cites work
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
- A new efficient algorithm for computing Gröbner bases (F₄)
- A probabilistic algorithm for k-SAT based on limited local search and restart
- Algebraic Cryptanalysis of the Data Encryption Standard
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 5604103 (Why is no real title available?)
- scientific article; zbMATH DE number 193014 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Improved agreeing-gluing algorithm
- Improved randomized algorithms for 3-SAT
- Information and Communications Security
- Methods to solve algebraic equations in cryptanalysis
- On solving sparse algebraic equations over finite fields
- Solving equation systems by agreeing and learning
- Solving multiple right hand sides linear equations
- Solving sparse linear equations over finite fields
- Sparse algebraic equations over finite fields
- Sparse Boolean equations and circuit lattices
Cited in
(10)- On solving sparse algebraic equations over finite fields
- Improved agreeing-gluing algorithm
- Speeding up deciphering by hypergraph ordering
- A combinatorial problem related to sparse systems of equations
- Sparse Boolean equations and circuit lattices
- MaxMinMax problem and sparse equations over finite fields
- An application of combinatorics in cryptography
- Sparse algebraic equations over finite fields
- Solving equation systems by agreeing and learning
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
This page was built for publication: Improved agreeing-gluing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254079)