3575 search results - page 24 / 715 » Presentations of computably enumerable reals |
179
click to vote
ANTS
2008
Springer
15 years 8 months ago
2008
Springer
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
158
click to vote
IEEEPACT
2002
IEEE
15 years 11 months ago
2002
IEEE
Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines ...
154
click to vote
STACS
2009
Springer
16 years 25 days ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
117
click to vote
ISSAC
2007
Springer
16 years 6 days ago
2007
Springer
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations of opera...
169
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Supercomputing applications usually involve the repeated parallel application of discretized differential operators. Difficulties arise with higher-order discretizations their com...