A new lower bound construction for commutative Thue systems with applications
DOI10.1016/S0747-7171(08)80138-1zbMATH Open0731.68060OpenAlexW2031477970MaRDI QIDQ808265FDOQ808265
Authors: Chee K. Yap 
Publication date: 1991
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80138-1
Recommendations
- On finite commutative Thue systems
- On reduced thue systems
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- On a method for proving exact bounds on derivational complexity in Thue systems
- scientific article; zbMATH DE number 68551
- scientific article; zbMATH DE number 1824154
- On the regular equivalence problem for regular Thue systems
- The Knuth-Bendix Completion Procedure and Thue Systems
- scientific article; zbMATH DE number 3880671
- scientific article; zbMATH DE number 3850464
lower boundscommutative Thue system[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=maximum+degree+Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go maximum degree Gr��bner basis]maximum degree in ideal membershipmaximum degree of the syzygy basis problem
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10) Thue and Post systems, etc. (03D03)
Cites Work
- On the complexity of computing syzygies
- Recursive unsolvability of a problem of Thue
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Fields of large transcendence degree generated by values of elliptic functions
- Constructions in Algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on upper bounds for ideal-theoretic problems
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
Cited In (14)
- On the parallel complexity of the polynomial ideal membership problem
- Ideals generated by quadrics exhibiting double exponential degrees
- Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal
- A software tool for the investigation of plane loci
- A solution to Kronecker's problem
- Dimension and depth dependent upper bounds in polynomial ideal theory
- Complexity of Membership Problems of Different Types of Polynomial Ideals
- New order bounds in differential elimination algorithms
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- Binomial ideals
- Complexity of a standard basis of a \(D\)-module.
- A sharp bound for the Castelnuovo-Mumford regularity of subspace arrangements.
- Bounding the degrees of a minimal \(\mu\)-basis for a rational surface parametrization
- On polynomial ideals, their complexity, and applications
This page was built for publication: A new lower bound construction for commutative Thue systems with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808265)
