4934 search results - page 180 / 987 » complexity 2008 |
122
click to vote
COMPLEXITY
2006
15 years 4 months ago
2006
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
122
click to vote
IPL
2007
15 years 4 months ago
2007
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
144
click to vote
MST
2008
15 years 4 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
139
click to vote
IPL
2007
15 years 4 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
114
Voted
COLING
1994
15 years 5 months ago
1994
t This paper describes how recent linguistic results in explaining Japanese short and long distance scram hling (:an be directly incorporated into an existing principles-and-parame...