๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of quadratic programming in real number models of computation

โœ Scribed by K. Meer

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
706 KB
Volume
133
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Note on the Divisibility of Class Numb
A Note on the Divisibility of Class Numbers of Real Quadratic Fields
โœ Gang Yu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

Suppose g > 2 is an odd integer. For real number X > 2, define S g รฐX รž the number of squarefree integers d4X with the class number of the real quadratic field Qรฐ ffiffiffi d p รž being divisible by g. By constructing the discriminants based on the work of Yamamoto, we prove that a lower bound S g รฐX

On the complexity of online computations
On the complexity of online computations of real functions
โœ Klaus Weihrauch ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences