1615 search results - page 37 / 323 » Computer science and decision theory |
Lecture Notes
These lecture notes cover several topics such as Topological Space, Metric Space, Convex Sets, Correspondences, Maximum Theorem, KKM Theorem, Existence of Maximal Element, Selectio...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
The rigidity of a matrix A for target rank r is the minimum number of entries of A that
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
DIS
2001
Springer
14 years 4 days ago
2001
Springer
Scientists need customizable tools to help them with discovery. We present an adjustable heuristic function for scientific discovery. This function may be considered in either a Mi...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P/poly) is not measurable within exponential time, in...