## Abstract

This note presents new complexity results for the comprehensive

Groebner bases (CGB) algorithm in the special case of one main variable

and two polynomials, a general remark about CGB for parameterized

binomial ideals, and it introduces the concept of comprehensive SAGBI

bases together with a first application in invariant theory.

Groebner bases (CGB) algorithm in the special case of one main variable

and two polynomials, a general remark about CGB for parameterized

binomial ideals, and it introduces the concept of comprehensive SAGBI

bases together with a first application in invariant theory.

Original language | English |
---|---|

Title of host publication | Computer Algebra in Scientific Computing |

Subtitle of host publication | CASC 2000; Proceedings of the 3rd Workshop on Computer Algebra in Scientific Computing; Samarkand, October 5-9, 2000 |

Publisher | Springer |

Pages | 191-202 |

Number of pages | 12 |

ISBN (Electronic) | 978-3-642-57201-2 |

ISBN (Print) | 978-3-540-41040-9 |

DOIs | |

Publication status | Published - Oct 2000 |

Event | 3rd Workshop on Computer Algebra in Scientific Computing - Samarkand, Uzbekistan Duration: 5 Oct 2000 → 9 Oct 2000 |

### Workshop

Workshop | 3rd Workshop on Computer Algebra in Scientific Computing |
---|---|

Abbreviated title | CASC 2000 |

Country/Territory | Uzbekistan |

City | Samarkand |

Period | 5/10/00 → 9/10/00 |

## Keywords

- comprehensive Groebner bases
- parameterized binomial ideals
- comprehensive SAGBI bases
- algorithmic invariant theory
- permutation groups