Back to Results
First PageMeta Content
Complexity classes / Structural complexity theory / FO / Finite model theory / Computational complexity theory / IP / Homomorphism / NP / Reduction / Symbol / P versus NP problem / Model theory


The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler
Add to Reading List

Document Date: 2009-11-10 10:55:46


Open Document

File Size: 281,57 KB

Share Result on Facebook