Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. The Geobucket Data Structure for Polynomials

The Geobucket Data Structure for Polynomials

File(s)
96-1607.pdf (285.89 KB)
96-1607.ps (234.58 KB)
Permanent Link(s)
https://hdl.handle.net/1813/7262
Collections
Computer Science Technical Reports
Author
Yan, Thomas
Abstract

The {\em geobucket/} data structure is suitable as an intermediate representation of polynomials for performing large numbers of polynomial additions and lead term extractions. A sum involving {$N$} terms has worst-case running time {$O(N\log{N})$} both online and offline, matching or surpassing the obvious/standard alternatives. This makes the geobucket a good choice for performing the reduction step of \grobner\ basis computations.

Date Issued
1996-09
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1607
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance