468 search results - page 24 / 94 » One-Way Functions in Complexity Theory |
79
Voted
LATA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
ACSC
2006
IEEE
15 years 5 months ago
2006
IEEE
Modern computer networks contain an amalgamation of devices and technologies, with the performance exhibited by each central to digital communications. Varieties of methods exist ...
101
click to vote
KR
2000
Springer
15 years 2 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
APAL
2010
14 years 11 months ago
2010
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
117
Voted
TRS
2008
14 years 11 months ago
2008
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...