Searching for "Complexity of the higher order matching." – sorted by Relevance.

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

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

2 documents found, showing 1 through 2.

Complexity of the Higher Order Matching
by Tomasz Wierzbicki — 2000 — Automated Deduction. Volume 1632 of LNCS
…Complexity of the higher order matching # ToMasz Wierzbicki + University of Wrocl/aw June 24…
Cited by 2 (0 self) – Add To MetaCart

Intelligence, pages 82-96, Trento, Italy, July 1999. Springer-Verlag. December 20, 2000. The RTA List of Open Problems
by Http Www Lri, Problem In Michel Bidoit, Max Dauchet
… higher-order matching is decidable and NP-complete [dG00]. More on the complexity of higher-order…
Add To MetaCart

Showing 1 through 2.

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