468 search results - page 6 / 94 » One-Way Functions in Complexity Theory |
NIPS
2000
15 years 5 days ago
2000
We introduce total wire length as salient complexity measure for an analysis of the circuit complexity of sensory processing in biological neural systems and neuromorphic engineer...
133
click to vote
CC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
FOCS
2005
IEEE
15 years 4 months 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...
114
click to vote
LICS
2012
IEEE
13 years 1 months ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...