Sciweavers

42230 search results - page 137 / 8446
» Algorithms and Complexity Results for
Sort
View
AAAI
2006
14 years 11 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 1 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
STOC
1996
ACM
132views Algorithms» more  STOC 1996»
15 years 2 months ago
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
Hans Kellerer, Thomas Tautenhahn, Gerhard J. Woegi...
JCSS
2008
120views more  JCSS 2008»
14 years 10 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
JUCS
2008
144views more  JUCS 2008»
14 years 10 months ago
New Results on NMAC/HMAC when Instantiated with Popular Hash Functions
Abstract: Message Authentication Code (MAC) algorithms can provide cryptographically secure authentication services. One of the most popular algorithms in commercial
Christian Rechberger, Vincent Rijmen