3208 search results - page 550 / 642 » A Lower Bound for Primality |
159
click to vote
ECCC
2000
15 years 5 months ago
2000
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
163
Voted
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
149
click to vote
DM
2002
15 years 5 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
169
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
155
click to vote
CPC
1998
15 years 5 months ago
1998
For any Boolean functionf letL(f) be its formulasizecomplexityin the basis f^ 1g. For every n and every k n=2, we describe a probabilistic distribution on formulas in the basis f^...