Sciweavers

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

30

FSTTCS
2007
Springer

favoriteEmaildiscussreport

123views Software Engineering» more FSTTCS 2007»

Satisfiability of Algebraic Circuits over Sets of Natural Numbers

14 years 5 months ago

Satisfiability of Algebraic Circuits over Sets of Natural Numbers

Download haegar.informatik.uni-wuerzburg.de

Christian Glaßer, Christian Reitwießne

Real-time Traffic

FSTTCS 2007 |

claim paper

Related Content

» Equivalence Problems for Circuits over Sets of Natural Numbers

» The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

» Digital Algebra and Circuits

» Algebraic Set Kernels with Application to Inference Over Local Image Representations

» Logic decomposition during technology mapping

» Monotonicity Criteria for Polynomial Interpretations over the Naturals

» Learning to satisfy

» Linear Diophantine Equations over Polynomials and Soft Decoding of ReedSolomon Codes

» Universal Algebra and Hardness Results for Constraint Satisfaction Problems

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	FSTTCS
Authors	Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr

Comments (0)