4781 search results - page 150 / 957 » Complexity at large |
LOGCOM
2007
13 years 10 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
COCO
1995
Springer
14 years 1 months ago
1995
Springer
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
SWWS
2008
13 years 11 months ago
2008
Abstract The growing demand for large and complex ontologies present new challenges related to their design, maintenance and evolution. In this paper, we propose an approach to man...
IWPSE
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper we present a new perspective on the problem of complexity in software, using sound mathematical concepts from information theory such as Shannon’s Entropy [31]. We...