Back to Results
First PageMeta Content
Logic / Mathematics / Constraint programming / Abstraction / Model theory / Boolean satisfiability problem / Electronic design automation / Logic in computer science / Complexity of constraint satisfaction / Constraint satisfaction problem / Satisfiability / Binary relation


The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE
Add to Reading List

Document Date: 2014-03-18 04:19:11


Open Document

File Size: 171,01 KB

Share Result on Facebook