2479 search results - page 286 / 496 » Quantum complexity theory |
159
click to vote
AO
2008
15 years 6 months ago
2008
Abstract. We address what is still a scarcity of general mathematical foundations for ontology-based semantic integration underlying current knowledge engineering methodologies in ...
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
167
Voted
ECCC
2010
15 years 6 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
165
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
157
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
We address the problem of estimating discrete variables in a class of deterministic transition systems in which the continuous variables are available for measurement. We propose ...