Sciweavers

4378 search results - page 118 / 876
» On the Complexity of Ordered Colourings
Sort
View
ENTCS
2011
131views more  ENTCS 2011»
13 years 5 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
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ā...
Ed Blakey
COGSCI
2004
78views more  COGSCI 2004»
13 years 10 months ago
Varieties of sameness: the impact of relational complexity on perceptual comparisons
The fundamental relations that underlie cognitive comparisons--"same" and "different"--can be demultiple levels of abstraction, which vary in relational comple...
James K. Kroger, Keith J. Holyoak, John E. Hummel
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 10 months ago
Flexible and efficient XML search with complex full-text predicates
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...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch
MFCS
2004
Springer
14 years 3 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
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 ...
John M. Hitchcock, María López-Vald&...
IJCAI
2003
13 years 11 months ago
Backdoors To Typical Case Complexity
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...
Ryan Williams, Carla P. Gomes, Bart Selman