1331 search results - page 190 / 267 » Complexity bounds for zero-test algorithms |
141
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
156
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
152
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
129
click to vote
CA
2000
IEEE
15 years 7 months ago
2000
IEEE
Hair-to-hair interaction is often ignored in human hair modeling, due to its computational and algorithmic complexity. In this paper, we present our experimental approach to simul...
153
click to vote
IJCAI
2007
15 years 4 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...