2446 search results - page 37 / 490 » Choiceless Polynomial Time |
BIRTHDAY
2010
Springer
13 years 5 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
CONCUR
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
IPPS
2003
IEEE
14 years 25 days ago
2003
IEEE
In this paper, SIMD and MIMD solutions for the realtime database management problem of air traffic control are compared. A real-time database system is highly constrained in a mul...