3897 search results - page 38 / 780 » complexity 2010 |
ENDM
2007
13 years 7 months ago
2007
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element g ∈ G such that d(g, e) = k for some k ∈ N. In this pa...
CC
2010
Springer
13 years 7 months ago
2010
Springer
We solve an open problem in communication complexity posed by Kushilevitz and Nisan (1997). Let R (f) and D
CIDU
2010
13 years 5 months ago
2010
Networks have been used to describe and model a wide range of complex systems, both natural as well as man-made. One particularly interesting application in the earth sciences is t...
ENDM
2006
13 years 7 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
COGSCI
2010
13 years 7 months ago
2010
This paper reports the results of a self-paced reading experiment in Japanese in which the materials consisted of four versions of successively more nested syntactic structures. I...