MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "A Lower Bound for Randomized Algebraic Decision Trees." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 3 documents found, showing 1 through 3.
ATOM RSS
  • A Lower Bound for Randomized Algebraic Decision Trees  
  • by Dima Grigoriev Marek, Marek Karpinski, Friedhelm Meyer Auf Der Heide, Roman Smolensky — 1996 — Proc. 28th ACM STOC
  • …A Lower Bound for Randomized Algebraic Decision Trees Dima Grigoriev y Marek Karpinski z…
  • Add To MetaCart
  • A Lower Bound for Randomized Algebraic Decision Trees  
  • by By Dima, Dima Grigoriev, Marek Karpinski, Friedhelm Meyer Auf Der Heide, Roman Smolensky — 1996 — Proc. 28th ACM STOC
  • …DIMACS Technical Report 96-45 A Lower Bound for Randomized Algebraic Decision Trees by Dima…
  • Add To MetaCart
Help! Showing 1 through 3.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB