7106 search results - page 356 / 1422 » Restricted Complexity, General Complexity |
140
Voted
EH
2000
IEEE
15 years 9 months ago
2000
IEEE
Evolvable Hardware (EHW) has the potential to become a new target hardware for complex real-world applications. However, there are several problems that would have to be solved to...
155
click to vote
CASC
2006
Springer
15 years 8 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
143
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
231
Voted
ICLP
2009
Springer
16 years 5 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
187
click to vote
LPAR
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...