Sciweavers

7773 search results - page 7 / 1555
» On generalized Frame-Stewart numbers
Sort
View
GD
2007
Springer
14 years 1 months ago
Improvement on the Decay of Crossing Numbers
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
Jakub Cerný, Jan Kyncl, Géza T&oacut...
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 7 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
ICALP
2004
Springer
14 years 28 days ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry
MOC
2011
13 years 2 months ago
Class numbers of ray class fields of imaginary quadratic fields
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
Omer Kucuksakalli
APPROX
2011
Springer
284views Algorithms» more  APPROX 2011»
12 years 7 months ago
On Approximating the Number of Relevant Variables in a Function
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
Dana Ron, Gilad Tsur