Sciweavers

2313 search results - page 8 / 463
» On Heuristic Time Hierarchies
Sort
View
CORR
1999
Springer
65views Education» more  CORR 1999»
14 years 11 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe
VLDB
2005
ACM
134views Database» more  VLDB 2005»
15 years 5 months ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
COCO
2001
Springer
104views Algorithms» more  COCO 2001»
15 years 4 months ago
Time-Space Tradeoffs in the Counting Hierarchy
Eric Allender, Michal Koucký, Detlef Ronneb...
IFIP
1994
Springer
15 years 3 months ago
Evolving Algebras and Linear Time Hierarchy
Andreas Blass, Yuri Gurevich