Sciweavers

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

7

STOC
1991
ACM

favoriteEmaildiscussreport

89views Algorithms» more STOC 1991»

The Expressive Power of Voting Polynomials

13 years 8 months ago

The Expressive Power of Voting Polynomials

Download cs-www.cs.yale.edu

James Aspnes, Richard Beigel, Merrick L. Furst, St

Real-time Traffic

Algorithms | STOC 1991 |

claim paper

Related Content

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» Enumeration and exact design of weighted voting games

» Exploiting the full power of temporal gene expression profiling through a new statistical ...

» Registration of 2D Points Using Geometric Algebra and Tensor Voting

» Multiresolution Feature Based Fractional Power Polynomial Kernel Fisher Discriminant Model...

» On the Compilability and Expressive Power of Propositional Planning Formalisms

» Approximating the Expressive Power of Logics in Finite Models

» From Equation to VHDL Using Rewriting Logic for Automated Function Generation

» Signature Evaluation Tool SET a Javabased tool to evaluate and visualize the sample discri...

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	STOC
Authors	James Aspnes, Richard Beigel, Merrick L. Furst, Steven Rudich

Comments (0)