Searching for "Optimal Lower Bounds on Regular Expression Size Using Communication Complexity." – 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.

Optimal lower bounds on regular expression size using communication complexity
by Hermann Gruber, Jan Johannsen — 2008 — Foundations of Software Science and Computation Structures, volume 4962 of LNCS
…Optimal Lower Bounds on Regular Expression Size using Communication Complexity Hermann Gruber…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 1.

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