2778 search results - page 3 / 556 » Limit complexities revisited |
JACM
2006
13 years 9 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
TCS
2010
13 years 4 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
RSFDGRC
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
AAAI
2012
12 years 5 days ago
2012
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (B¨ackstr¨om and Nebel) have influenced followin...