1552 search results - page 40 / 311 » On the Complexity of Constant Propagation |
92
Voted
CORR
2008
Springer
15 years 2 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...
ITA
2008
15 years 1 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...
113
click to vote
MFCS
2009
Springer
15 years 6 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...
109
click to vote
IEEEARES
2006
IEEE
15 years 8 months 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, ...
CIE
2005
Springer
15 years 7 months 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...