2661 search results - page 465 / 533 » Quantum Complexity Classes |
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
129
Voted
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
111
click to vote
ICCD
2006
IEEE
15 years 9 months ago
2006
IEEE
Pointer bugs associated with dynamically-allocated objects resulting in out-of-bounds memory access are an important class of software bugs. Because such bugs cannot be detected e...
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
106
click to vote
HYBRID
2010
Springer
15 years 7 months ago
2010
Springer
The complexity of physical and engineering systems, both in terms of the governing physical phenomena and the number of subprocesses involved, is mirrored in ever more complex mat...