Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
12
Voted
ENTCS
2008
favorite
Email
discuss
report
65
views
more
ENTCS 2008
»
Proofs as Polynomials
13 years 9 months ago
Download
xavier.informatics.indiana.edu
Esfandiar Haghverdi, Philip J. Scott
Real-time Traffic
ENTCS 2008
|
claim paper
Related Content
»
An elementary proof of Sylvesters double sums for subresultants
»
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
»
On the Proof Complexity of Deep Inference
»
Factorization of multivariate positive Laurent polynomials
»
Random Cnfs are Hard for the Polynomial Calculus
»
A Tuttestyle proof of Brylawskis tensor product formula
»
The Proof Complexity of Polynomial Identities
»
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
»
Polynomial Interpretations and the Complexity of Algorithms
»
Algebraic Proofs over Noncommutative Formulas
more »
Post Info
More Details (n/a)
Added
10 Dec 2010
Updated
10 Dec 2010
Type
Journal
Year
2008
Where
ENTCS
Authors
Esfandiar Haghverdi, Philip J. Scott
Comments
(0)
Researcher Info
ENTCS 2010 Study Group
Computer Vision