793 search results - page 119 / 159 » Argumentation and standards of proof |
102
Voted
COCO
2005
Springer
15 years 2 months ago
2005
Springer
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...
100
Voted
COCOON
2008
Springer
15 years 2 months ago
2008
Springer
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
120
Voted
BIOCOMP
2007
15 years 2 months ago
2007
Background: Genetic regulatory networks (GRN) can be described by differential equations with SUM logic which has been found in many natural systems. Identification of the network...
112
click to vote
MCU
2004
15 years 2 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
102
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...