Sciweavers

1809 search results - page 24 / 362
» Weakly Computable Real Numbers
Sort
View
LOGCOM
2002
72views more  LOGCOM 2002»
13 years 7 months ago
Definability in Rationals with Real Order in the Background
The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families definable over the real line wi...
Yuri Gurevich, Alexander Moshe Rabinovich
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
13 years 9 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
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...
Lassina Dembélé, Steve Donnelly
COMPGEOM
2005
ACM
13 years 9 months ago
On the exact computation of the topology of real algebraic curves
We consider the problem of computing a representation of the plane graph induced by one (or more) algebraic curves in the real plane. We make no assumptions about the curves, in p...
Raimund Seidel, Nicola Wolpert
LICS
1997
IEEE
13 years 12 months ago
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that ...
Martín Hötzel Escardó, Thomas S...
ICON
2007
IEEE
14 years 1 months ago
Potential Impacts of Four-Byte AS Numbers in Partial Deployment
—Inter-domain routing is suffering from the lack of identifiers for the rapidly growing number of Autonomous Systems (AS), and therefore the 4-byte AS number has been proposed a...
Yuncheng Zhu, Junxiu Lu, Maoke Chen