244
Voted
CSR
14 years 10 months ago
2011 Springer 
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
200
Voted
CSR
14 years 10 months ago
2011 Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
|
Theoretical Computer Science