1802 search results - page 21 / 361 » Complexity Theory for Operators in Analysis |
173
click to vote
JACM
2002
15 years 6 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
169
click to vote
AMC
2007
15 years 6 months ago
2007
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
188
click to vote
ECAL
1995
Springer
15 years 10 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 ...
153
click to vote
FOCS
2005
IEEE
16 years 2 days ago
2005
IEEE
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
196
click to vote
JMIV
2002
15 years 6 months ago
2002
This paper develops a multiscale connectivity theory for shapes based on the axiomatic definition of new generalized connectivity measures, which are obtained using morphology-base...