16666 search results - page 139 / 3334 » Descriptive and Computational Complexity |
COMPUTER
2004
15 years 4 months ago
2004
COMPUTING
1998
15 years 3 months ago
1998
150
Voted
ECAL
1995
Springer
15 years 7 months ago
1995
Springer
Arti cial Life and the more general area of Complex Systems does not have a uni ed theoretical framework although most theoretical work in these areas is based on simulation. This ...
124
click to vote
COMGEO
2008
ACM
15 years 4 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
153
click to vote
CIE
2010
Springer
15 years 9 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...