Juan Luis Esteban, Nicola Galesi, Jochen Messner. On the Complexity of Resolution with Bounded Conjunctions. In Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo, editors, Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Volume 2380 of Lecture Notes in Computer Science, pages 220-231, Springer, 2002. [doi]
Abstract is missing.