1888 search results - page 6 / 378 » Proof theory and computational analysis |
COMPGEOM
2009
ACM
14 years 1 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
14 years 21 days ago
2006
IEEE
U. Berger, [11] significantly simplified Tait’s normalisation proof for bar recursion [27], see
CORR
2002
Springer
13 years 6 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...
POPL
2006
ACM
14 years 7 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...
FOCS
1995
IEEE
13 years 10 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...