4378 search results - page 118 / 876 » On the Complexity of Ordered Colourings |
176
click to vote
ENTCS
2011
15 years 1 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
134
click to vote
COGSCI
2004
15 years 6 months ago
2004
The fundamental relations that underlie cognitive comparisons--"same" and "different"--can be demultiple levels of abstraction, which vary in relational comple...
262
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
151
click to vote
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
183
click to vote
IJCAI
2003
15 years 7 months ago
2003
There has been signiļ¬cant recent progress in reasoning and constraint processing methods. In areas such as planning and ļ¬nite model-checking, current solution techniques can h...