Sciweavers

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

11

SAT
2007
Springer

favoriteEmaildiscussreport

81views Hardware» more SAT 2007»

On the Boolean Connectivity Problem for Horn Relations

13 years 11 months ago

On the Boolean Connectivity Problem for Horn Relations

Download www.csi.ucd.ie

Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto

Real-time Traffic

SAT 2007 |

claim paper

Related Content

» The Complexity of Boolean Matrix Root Computation

» Computational Complexity of Constraint Satisfaction

» Abduction and the Dualization Problem

» Relating complexity and precision in control flow analysis

» Circuit Based Encoding of CNF Formula

» Sublinear Communication Protocols for MultiParty Pointer Jumping and a Related Lower Bound

» Boolean Functions for FiniteTree Dependencies

» Characterizing Implications of Injective Partial Orders

» Complexity and Algorithms for Monomial and Clausal Predicate Abstraction

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	SAT
Authors	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto

Comments (0)