1717 search results - page 300 / 344 » A Computable Spectral Theorem |
DCG
2008
15 years 17 days ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
DISOPT
2008
15 years 17 days ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
99
Voted
CORR
2006
Springer
15 years 15 days ago
2006
Springer
We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical s...
81
Voted
CORR
2006
Springer
15 years 15 days ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
98
Voted
JANCL
2008
15 years 14 days ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...