Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COMBINATORICS
2006

favoriteEmaildiscussreport

158views more COMBINATORICS 2006»

Reduced Canonical Forms of Stoppers

13 years 4 months ago

Reduced Canonical Forms of Stoppers

Download www.combinatorics.org

The reduced canonical form of a loopfree game G is the simplest game infinitesimally close to G. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel provided an alternate proof of their existence. In this paper, we show that the Grossman

Aaron N. Siegel

Real-time Traffic

Canonical Forms | COMBINATORICS 2006 | Loopfree Game | Simplest Game |

claim paper

Related Content

» Canonical Form Based MAP2 Fitting

» Numbering matters firstorder canonical forms for secondorder recursive types

» Boolean Matching Using Generalized ReedMuller Forms

» Canonization for Disjoint Unions of Theories

» Normal Forms for Knowledge Compilation

» VHDL Implementation of Multiplierless High Performance DWT Filter Bank

» Untyped XQuery Canonization

» Quadratic minimisation problems in statistics

» Integrative analysis of gene expression and copy number alterations using canonical correl...

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Aaron N. Siegel

Comments (0)