Cited By
View all- Li HWang D(2007)A recipe for symbolic geometric computingProceedings of the 2007 international symposium on Symbolic and algebraic computation10.1145/1277548.1277584(261-268)Online publication date: 29-Jul-2007
In symbolic geometric reasoning, the output of an algebraic method is expected to be geometrically interpretable, and the size of the middle steps is expected to be sufficiently small for computational efficiency. Invariant algebras often perform well ...
For finite automata as coalgebras in a category C, we study languages they accept and varieties of such languages. This generalizes Eilenberg’s concept of a variety of languages, which corresponds to choosing as C the category of Boolean algebras. ...
In symbolic computing, a major bottleneck is middle expression swell. Symbolic geometric computing based on invariant algebras can alleviate this difficulty. For example, the size of projective geometric computing based on bracket algebra can often be ...
Springer-Verlag
Berlin, Heidelberg