arXiv (All)
open access
Degree bounds and synchronization in Gröbner basis computations for affine semi-regular systems
Determining the complexity of computing Gröbner bases is an important problem in both theory and practice, and solving degrees provide a central measure of this complexity. We study solving degrees and Gröbner basis computations for affine polynomial systems, with particular emphasis on semi-regular
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points#1013523
- Introduction to Complex Automata using Cook Algebra#110998
- ScanWeaver: Compiler-Driven Parallelization of Affine Recurrences via Associative Scan Lowering#246531
- CompileRover: Revolutionizing Virtual Machine Compiler Optimization with a Tri-Role LLM-Driven Framework#1013159
- Trinomial containment in polynomial ideals is undecidable#819179
Record · ID 820141
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive