13306 search results - page 478 / 2662 » Theoretical Computer Science |
194
click to vote
CAD
2004
Springer
15 years 7 months ago
2004
Springer
Given a nonsingular compact two-manifold F without boundary, we present methods for establishing a family of surfaces which can approximate F so that each approximant is ambient i...
190
click to vote
CCA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
198
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
194
click to vote
PDC
2004
ACM
16 years 1 months ago
2004
ACM
As technology becomes more embedded in our daily lives, there is a great deal of hope about the use of information technology to achieve positive community outcomes like increasin...
251
click to vote
CCA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...