14699 search results - page 299 / 2940 » Complexity and Cognitive Computing |
110
click to vote
AISC
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
112
click to vote
IJCAI
2003
15 years 5 months ago
2003
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
120
click to vote
MOC
2010
14 years 11 months ago
2010
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
180
click to vote
PODS
1994
ACM
15 years 8 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
160
click to vote
TCS
2011
14 years 11 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...