Searching for "Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time." – 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.

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
by Michael R. Laurence, Sebastian Danicic, Mark Harman, Rob Hierons, John Howroyd — 2004
…Equivalence of Linear, Free, Liberal, Structured Program Schemas is Decidable in Polynomial Time…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 1.

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