{"id":"https://openalex.org/W7097948467","doi":null,"title":"A new incremental algorithm for computing Gr\u00f6bner bases","display_name":"A new incremental algorithm for computing Gr\u00f6bner bases","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7097948467"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.210.3323","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.3323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.clemson.edu/faculty/Gao/papers/GGV10.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7097948467"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Shuhong Gao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shuhong Gao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037241972","display_name":"Yinhua Guan","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yinhua Guan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072902951","display_name":"Frank Volny","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank Volny Iv","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12069","display_name":"Commutative Algebra and Its Applications","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13806","display_name":"Mathematical and Computational Methods","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2611","display_name":"Modeling and Simulation"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/grobner-bases","display_name":"Gr\u00f6bner bases","score":0.9729999899864197},{"id":"https://openalex.org/keywords/incremental-algorithms","display_name":"incremental algorithms","score":0.7770000100135803},{"id":"https://openalex.org/keywords/f5-algorithm","display_name":"F5 algorithm","score":0.8140000104904175},{"id":"https://openalex.org/keywords/s-polynomials","display_name":"S-polynomials","score":0.8420000076293945},{"id":"https://openalex.org/keywords/polynomial-ideals","display_name":"polynomial ideals","score":0.7429999709129333},{"id":"https://openalex.org/keywords/polynomial-reduction","display_name":"polynomial reduction","score":0.3790000081062317},{"id":"https://openalex.org/keywords/computational-efficiency","display_name":"computational efficiency","score":0.5529999732971191}],"concepts":[{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.8102999925613403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6464999914169312},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6176999807357788},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5209000110626221},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4406999945640564},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4147000014781952},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.37400001287460327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.26600000262260437}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.210.3323","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.3323","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.clemson.edu/faculty/Gao/papers/GGV10.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2058865345","https://openalex.org/W1899807926","https://openalex.org/W2023845786","https://openalex.org/W7095879344","https://openalex.org/W6929325494","https://openalex.org/W7095124112","https://openalex.org/W7099610673","https://openalex.org/W2039373680","https://openalex.org/W1993995116","https://openalex.org/W2045154989"],"abstract_inverted_index":{"In":[0,89,111],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,25,31,49],"new":[6,54],"algorithm":[7,13,77,142],"for":[8,35,52,81],"computing":[9],"Gr\u00f6bner":[10,32,50,79],"bases.":[11],"Our":[12,76],"is":[14,29,45,143],"incremental":[15],"in":[16,99,121,127],"the":[17,53,68,130],"same":[18],"fashion":[19],"as":[20,107,109],"F5":[21,101,153],"and":[22,39,43,85,124,154],"F5C.":[23,155],"At":[24],"typical":[26],"step,":[27],"one":[28],"given":[30],"basis":[33,51],"G":[34],"an":[36],"ideal":[37,55,70],"I":[38,60,72],"any":[40],"polynomial":[41],"g,":[42],"it":[44],"desired":[46],"to":[47,95,103,148],"compute":[48],"\u2329I,":[56,82],"g\u232a,":[57],"obtained":[58],"from":[59],"by":[61,74],"joining":[62],"g.":[63,75],"Let":[64],"(I:":[65,86,122],"g)":[66,87,123],"denote":[67],"colon":[69],"of":[71],"divided":[73],"computes":[78],"bases":[80],"g":[83],"\u232a":[84],"simultaneously.":[88],"previous":[90],"algorithms,":[91],"S-polynomials":[92,118],"that":[93,140],"reduce":[94],"zero":[96],"are":[97,125],"useless,":[98],"fact,":[100],"tries":[102],"avoid":[104],"such":[105],"reductions":[106],"much":[108,144],"possible.":[110],"our":[112,141],"algorithm,":[113],"however,":[114],"these":[115],"\u201cuseless":[116],"\u201d":[117],"give":[119],"elements":[120],"useful":[126],"speeding":[128],"up":[129],"subsequent":[131],"computations.":[132],"Computer":[133],"experiments":[134],"on":[135],"some":[136],"benchmark":[137],"examples":[138],"indicate":[139],"more":[145],"efficient":[146],"(two":[147],"ten":[149],"times":[150],"faster)":[151],"than":[152]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7097948467","counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2025-10-27T00:00:00"}
