Sciweavers

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

29

LICS
2006
IEEE

favoriteEmaildiscussreport

104views Automated Reasoning» more LICS 2006»

Approximate Satisfiability and Equivalence

14 years 4 months ago

Approximate Satisfiability and Equivalence

Download www.cs.technion.ac.il

Eldar Fischer, Frédéric Magniez, Mic

Real-time Traffic

Computer Science | LICS 2006 |

claim paper

Related Content

» Conditional hardness for satisfiable 3CSPs

» Approximating Transitivity in Directed Networks

» An Empirical Analysis of Equivalence Partitioning Boundary Value Analysis and Random Testi...

» Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques

» Combinational Equivalence Checking Using Satisfiability and Recursive Learning

» Boolean Satisfiability and Equivalence Checking Using General Binary Decision Diagrams

» Semidefinite Optimization Approaches for Satisfiability and MaximumSatisfiability Problems

» Inapproximability of Survivable Networks

» Cyclical scheduling and multishift scheduling Complexity and approximation algorithms

Post Info
More Details (n/a)

Added	12 Jun 2010
Updated	12 Jun 2010
Type	Conference
Year	2006
Where	LICS
Authors	Eldar Fischer, Frédéric Magniez, Michel de Rougemont

Comments (0)