Phase transition of multivariate polynomial systems
From MaRDI portal
Recommendations
- Phase Transition of Multivariate Polynomial Systems
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Semi-regular sequences and other random systems of equations
- On the Number of Linearly Independent Equations Generated by XL
- Estimates for the probability that a system of random equations is solvable in a given set of vectors over the field GF(3)
Cites work
- A well-characterized approximation problem
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Limit probabilities for coranks of matrices over GF(q)
- Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
- Results related to threshold phenomena research in satisfiability: Lower bounds
- Sharp thresholds of graph properties, and the k-sat problem
- The Complexity of Enumeration and Reliability Problems
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
Cited in
(3)
This page was built for publication: Phase transition of multivariate polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616213)