96 search results - page 13 / 20 » Complexity of Decision Problems for Mixed and Modal Specific... |
115
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
114
click to vote
JAIR
2008
15 years 1 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
123
Voted
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
100
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
134
click to vote
TOC
2010
14 years 8 months ago
2010
: We define quantum expanders in a natural way and give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...