Solving linear equations over polynomial semirings
- 24 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 466-472
- https://doi.org/10.1109/lics.1996.561463
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Set constraints are the monadic classPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the unification problem for Cartesian closed categoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A decision procedure for a class of set constraintsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner basesJournal of the ACM, 1993
- Complexity of unification problems with associative-commutative operatorsJournal of Automated Reasoning, 1992
- Adding homomorphisms to commutative/monoidal theories or how algebra can help in equational unificationPublished by Springer Nature ,1991
- Unification in monoidal theoriesPublished by Springer Nature ,1990
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal TheoryPublished by Springer Nature ,1985