468 search results - page 51 / 94 » One-Way Functions in Complexity Theory |
113
click to vote
COMPLEX
2009
Springer
15 years 10 months ago
2009
Springer
Investors would like to calculate profits in advance, “ex ante”, like the path of a flying ball. But income can only be given “ex post”, after the money is earned. The pro...
140
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
134
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
186
click to vote
TNN
2010
14 years 11 months ago
2010
This paper proposes three novel training methods, two of them based on the back-propagation approach and a third one based on information theory for Multilayer Perceptron (MLP) bin...
128
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...