2520 search results - page 142 / 504 » The complexity of approximating entropy |
SIGMOD
1999
ACM
15 years 3 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
FOCS
2004
IEEE
15 years 2 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
COCO
2008
Springer
15 years 15 days ago
2008
Springer
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
CCCG
2010
15 years 5 days ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
DEXA
2010
Springer
14 years 11 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...