Searching for "Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates." – 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.

Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
by Dima Grigoriev, Nicolai Vorobjov — 1996 — Theoretical Computer Science
…Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates…
Cited by 8 (3 self) – Add To MetaCart

Showing 1 through 1.

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