1552 search results - page 40 / 311 » On the Complexity of Constant Propagation |
140
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
160
click to vote
ITA
2008
15 years 6 months ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
170
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
159
click to vote
IEEEARES
2006
IEEE
16 years 22 days ago
2006
IEEE
—Today’s business climate requires you to constantly evolve IT strategies responding to new opportunities or threats. While the fundamentals of IT - reliability, availability, ...
111
click to vote
CIE
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...