1071 search results - page 19 / 215 » Theories of Automatic Structures and Their Complexity |
COCOA
2011
Springer
12 years 7 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
WG
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ACRI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper reviews the history of embedded, evolvable selfreplicating structures implemented as cellular automata systems. We relate recent advances in this field to the...
IJAC
2002
13 years 7 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
AIME
2009
Springer
14 years 2 months ago
2009
Springer
The computerisation of clinical guidelines can greatly benefit from the automatic analysis of their content using Natural Language Processing techniques. Because of the central rol...