NP-completeness of some restricted linear formula classes
Konferenzbeitrag › Konferenzpaper
› 2006
Zitation
Konferenzbeitrag Full Paper
Porschen, S.; Speckenmeyer, E.: NP-completeness of some restricted linear formula classes. In: Proceedings Guangzhou Symposium on Satisfiability in Logic-Based Modeling. Hg. von Sun Yat-sen Universität, Guangzhou, China. Guangzhou, China: 2006, S. 113-123.