13306 search results - page 312 / 2662 » Theoretical Computer Science |
423
click to vote
SIGCSE
2008
ACM
15 years 6 months ago
2008
ACM
Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
183
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
183
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. A competition between systems for doing exact real number computations was held in September 2000. We present the results obtained and give a short evaluation of the di...
169
Voted
CCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped λ-ca...