590 search results - page 43 / 118 » Some Aspects of Computable Functional Analysis |
103
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
114
click to vote
EOR
2008
15 years 3 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
131
click to vote
MABS
2004
Springer
15 years 8 months ago
2004
Springer
Recent events have highlighted the importance of good models of crowds, however many existing crowd models are either computationally inefficient, or are missing a crucial human be...
136
Voted
WSC
1997
15 years 4 months ago
1997
I will elaborate some principles of ethical conduct in science that correspond to Richard Feynman’s wellknown precepts of “utter honesty” and “leaning over backwards” in...
108
click to vote
UC
2009
Springer
15 years 10 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...