An Estimator for the Hardness of the MQ Problem
- 6 October 2022
- book chapter
- Published by Springer Nature
- p. 323-347
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- On the complexity of solving quadratic Boolean systemsJournal of Complexity, 2013
- Extended Algorithm for Solving Underdefined Multivariate Quadratic Equations2013
- Algorithms to Solve Massively Under-Defined Systems of Multivariate Quadratic EquationsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
- Phase Transition of Multivariate Polynomial Systems2007
- Theoretical Analysis of XL over Small Fields2004
- Comparison Between XL and Gröbner Basis Algorithms2004
- Solving Underdefined Systems of Multivariate Quadratic Equations2002
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993
- Gaussian elimination is not optimalNumerische Mathematik, 1969