513 search results - page 14 / 103 » Finitely Based, Finite Sets of Words |
DGCI
2008
Springer
13 years 10 months ago
2008
Springer
Based on a classical convex hull algorithm called Gift-Wrapping, the purpose of the paper is to provide a new algorithm for computing the vertices of a polytope called preimage - ...
DGCI
2000
Springer
14 years 24 days ago
2000
Springer
The paper presents a new method of investigating topological properties of three-dimensional manifolds by means of computers. Manifolds are represented as finite cell complexes. Th...
PKC
2000
Springer
14 years 21 hour ago
2000
Springer
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over...
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
INFORMATICALT
2008
13 years 8 months ago
2008
Abstract. A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle `The part i...