2661 search results - page 246 / 533 » Quantum Complexity Classes |
118
click to vote
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
124
Voted
WIA
2001
Springer
15 years 8 months ago
2001
Springer
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
136
click to vote
CL
2000
Springer
15 years 8 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
129
click to vote
ECOOP
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. An object-oriented language that permits changing the behavior of a class or of a single object is said to support computational reflection. Existing reflective facilitie...
138
click to vote
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...