On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations

By Jean-Charles Faugère, Magali Bardet, Bruno Salvy. 2004

248 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/bbfdfc4df8f8c5cee39da2d1dda558fffb8f9ef4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Masahiro Yagisawa
2. Shai Halevi
3. Joppe W. Bos
4. Craig Gentry
5. Yarkin Doröz
6. Kristin E. Lauter
7. Michael Naehrig
8. Ciara Moore

Citations in the corpus

• Fully Homomorphic Encryption without bootstrapping (2015, background): “With homomorphic encryption, a company could encrypt its entire database of e- mails and upload it to a cloud.”