2661 search results - page 117 / 533 » Quantum Complexity Classes |
119
click to vote
AIPS
2009
15 years 4 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
123
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
131
click to vote
IANDC
2006
15 years 3 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
140
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
— The differential encoding/decoding setup introduced by Kiran et al, Oggier et al and Jing et al for wireless relay networks that use codebooks consisting of unitary matrices is...
122
click to vote
DAM
1999
15 years 2 months ago
1999
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...