4126 search results - page 710 / 826 » Relationships with other Formalisms |
300
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
161
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
Background: Correlations between polymorphic markers and observed phenotypes provide the basis for mapping traits in quantitative genetics. When the phenotype is gene expression, ...
176
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
163
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
169
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...