External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity of the Satisfiability Problem for a Class of Propositional Schemata

Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier. Complexity of the Satisfiability Problem for a Class of Propositional Schemata. In Adrian Horia Dediu, Henning Fernau, Carlos Martín-Vide, editors, Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings. Volume 6031 of Lecture Notes in Computer Science, pages 58-69, Springer, 2010. [doi]

Authors

Vincent Aravantinos

This author has not been identified. Look up 'Vincent Aravantinos' in Google

Ricardo Caferra

This author has not been identified. Look up 'Ricardo Caferra' in Google

Nicolas Peltier

This author has not been identified. Look up 'Nicolas Peltier' in Google
runs on