Searching for "On the complexity of resolution with bounded conjunctions." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On the Complexity of Resolution with Bounded Conjunctions
by Juan Luis Esteban, Nicola Galesi, Jochen Messner, Abt Theoretische Informatik — 2004 — In 29th International Colloquium on Automata, Languages and Programming
…On the Complexity of Resolution with Bounded Conjunctions Juan Luis Esteban y , Nicola Galesi…
Cited by 12 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB