937 search results - page 40 / 188 » On the Complexity of Partial Order Properties |
149
click to vote
CORR
1998
Springer
15 years 5 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
133
click to vote
ORDER
2010
15 years 4 months ago
2010
This paper investigates quantum logic from the perspective of categorical logic, and starts from minimal assumptions, namely the existence of involutions/daggers and kernels. The ...
152
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
- A new class of Quasi-Orthogonal Space-Time Block Code (QO-STBC) namely Minimum-DecodingComplexity QO-STBC (MDC-QOSTBC) has recently been proposed in the literature. In this paper...
219
Voted
SPATIALCOGNITION
2000
Springer
15 years 9 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
122
click to vote
ENTCS
2010
15 years 6 months ago
2010
The global states of complex systems often form pospaces, topological spaces equipped with compatible partial orders reflecting causal relationships between the states. The calcul...