Ulla Koppenhagen and Ernst W. Mayr
      An Optimal Algorithm for
      Constructing the Reduced Gröbner Basis of Binomial
      Ideals
      Technical Report TUM-I9605. 
      PS-File (408kB),
      gzipped PS-File (117kB) 
      Proceedings of the 1996 International Symposium on Symbolic and
      Algebraic Computation (ISSAC'96), pages 55-62, ACM Press, 1996.
      
   Ulla Koppenhagen and Ernst W. Mayr 
      Optimal Gröbner Base
      Algorithms for Binomial Ideals 
      Technical Report TUM-I9604.
      PS-File (360kB),
      gzipped PS-File (104kB) 
      Proceedings of the 23rd International Colloquium on Automata,
      Languages and Programming (ICALP'96), LNCS 1099, pages 244-255,
      Springer-Verlag, 1996.
      
   Ulla Koppenhagen and Ernst W. Mayr 
      An Optimal Algorithm for Constructing the
      Reduced Gröbner Basis of Binomial Ideals and
      Applications 
      Journal of Symbolic Computation. To appear.
      
   Ulla Koppenhagen and Ernst W. Mayr 
      The Complexity of the Equivalence
      Problem for Commutative Semigroups 
      Technical Report TUM-I9603.
      PS-File (384kB),
      gzipped PS-File (112kB)
      
   Ulla Koppenhagen and Ernst W. Mayr 
      The Complexity of the
      Boundedness, Coverability, and Selfcoverability Problems for
      Commutative Semigroups 
      Technical Report TUM-I9518.
      PS-File (294kB),
      gzipped PS-File (78kB)
 
 Ulla Koppenhagen, 1997/06/12
 |