Sciweavers

37 search results - page 8 / 8
» mfcs 2005
Sort
View
80
Voted
MFCS
2005
Springer
15 years 2 months ago
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Mi...
COCO
2005
Springer
130views Algorithms» more  COCO 2005»
14 years 11 months ago
Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
Emanuele Viola