2853 search results - page 316 / 571 » On Coherence in Computer Algebra |
156
click to vote
ISSAC
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
117
click to vote
COCO
1989
Springer
15 years 8 months ago
1989
Springer
For a monoid G, the iterated multiplication problem is the computation of the product of n elements from G. By re ning known completeness arguments, we show that as G varies over ...
149
click to vote
DATESO
2004
15 years 5 months ago
2004
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binar...
139
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
We motivate and define a category of topological domains, whose objects are certain topological spaces, generalising the usual -continuous dcppos of domain theory. Our category su...
118
click to vote
DLT
2006
15 years 5 months ago
2006
Let be an alphabet of size t, let f : be a non-erasing morphism, let w be an infinite fixed point of f, and let E(w) be the critical exponent of w. We prove that if E(w) is fi...