Sciweavers

18 search results - page 1 / 4
» Computing the fixing group of a rational function
Sort
View
CORR
2008
Springer
51views Education» more  CORR 2008»
13 years 4 months ago
Computing the fixing group of a rational function
Jaime Gutierrez, Rosario Rubio, David Sevilla
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 4 months ago
Decomposing replicable functions
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
John McKay, David Sevilla
ECOOPW
1998
Springer
13 years 8 months ago
A Rational Approach to Portable High Performance: The Basic Linear Algebra Instruction Set (BLAIS) and the Fixed Algorithm Size
Abstract. We introduce a collection of high performance kernels for basic linear algebra. The kernels encapsulate small xed size computations in order to provide building blocks fo...
Jeremy G. Siek, Andrew Lumsdaine
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 4 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
SIAMCOMP
2010
174views more  SIAMCOMP 2010»
13 years 3 months ago
On the Complexity of Nash Equilibria and Other Fixed Points
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
Kousha Etessami, Mihalis Yannakakis