Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
147
views
32
references
 Top references
cited by
11
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,801
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Advances in Cryptology – ASIACRYPT 2012 

      On Polynomial Systems Arising from a Weil Descent

      other
      Author(s): ,
      Publication date (Print):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references32

          • Record: found
          • Abstract: not found
          • Article: not found

          A new efficient algorithm for computing Gröbner bases (F4)

          Jean-Charles Faugère (1999)
          Article 0 comments Cited 137 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Some Properties of Enumeration in the Theory of Modular Systems

            F. MacAulay (1927)
            Article 0 comments Cited 72 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Conference Proceedings: not found

              A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)

              Jean Charles Faugère (2002)
              Article 0 comments Cited 57 times – based on 0 reviews
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2012
                Pages: 451-466
                DOI: 10.1007/978-3-642-34961-4_28
                SO-VID: f37ce952-3996-4087-8275-c70ebc54b909
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,801

                See all similar

                Cited by11

                See all cited by