Q5091175
type: Item
instance of: scholarly article
author: Andreas Björklund
author: Petteri Kaski
author: Ryan Williams
publication date: 2022-07-21T00:00:00Z
Mathematics Subject Classification ID: 68Nxx
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7561519
zbMATH Keywords: equation systems
zbMATH Keywords: polynomial method
MaRDI profile type: Publication
cites work: On the complexity of solving quadratic Boolean systems
cites work: Fast Zeta Transforms for Lattices with Few Irreducibles
cites work: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
cites work: Ideals, Varieties, and Algorithms
cites work: Complexity of problems in games, graphs and algebraic equations
cites work: Fast Möbius inversion in semimodular lattices and ER-labelable posets
cites work: Unbalanced Oil and Vinegar Signature Schemes
cites work: Beating Brute Force for Systems of Polynomial Equations over Finite Fields
cites work: Q4286756
cites work: Some complexity results for polynomial ideals
cites work: Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
cites work: A full derandomization of schöning's k-SAT algorithm
cites work: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: NP is as easy as detecting unique solutions
DOI: 10.4230/LIPICS.ICALP.2019.26
description: scientific article; zbMATH DE number 7561519