Sciweavers

1004 search results - page 14 / 201
» Product representations of polynomials
Sort
View
157
Voted
JGAA
2007
123views more  JGAA 2007»
15 years 4 months ago
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
Louigi Addario-Berry, Neil Olver, Adrian Vetta
121
Voted
FUIN
2006
93views more  FUIN 2006»
15 years 5 months ago
Membrane Computing and Economics: Numerical P Systems
Abstract. With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve,...
Gheorghe Paun, Radu A. Paun
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 10 months ago
Fast Truncated Multiplication for Cryptographic Applications
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
Laszlo Hars
113
Voted
JCT
2011
84views more  JCT 2011»
14 years 12 months ago
Explicit separating invariants for cyclic P-groups
Abstract. We consider a finite dimensional indecomposable modular representation of a cyclic p-group and we give a recursive description of an associated separating set: We show t...
Müfit Sezer
MOC
1998
107views more  MOC 1998»
15 years 4 months ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche