1888 search results - page 6 / 378 » Proof theory and computational analysis |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
LICS
2006
IEEE
15 years 3 months ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
74
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Abstract. The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory a...
189
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
79
Voted
FOCS
1995
IEEE
15 years 1 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...