OpenAlex
PricingAboutJobs
Log inGet started
Work

New algorithms for computing groebner bases

HTML

Year: 2011
Type: preprint
Source: IACR Cryptology ePrint Archive
Authors: Shuhong Gao, Frank Volny
Institution: Clemson University
Language: English

Topic: Polynomial and algebraic computation
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Gröbner bases, F5 algorithm, Buchberger's algorithm, syzygy modules, S-polynomials, term orderings, termination proofs, polynomial ideals

Open Access status: closed
OpenAlex ID: W2023845786
Cites:
Cited by: 26
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security