Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A probabilistic lower bound for checking disjointness of sets
Manber U. (ed) Information Processing Letters19 (1):51-53,1984.Type:Article
Date Reviewed: Feb 1 1985

This three-page article discusses how probabilistic decision trees can be faster than dterministic decision trees in checking for the disjointness of sets. The article is too restrictive and too particular to be of much general interest. The author’s assumptions are so severe that the theorem and proof seem to be of limited value. Even the seven-item reference list seems to be limited in scope.

Reviewer:  G. Carlson Review #: CR108889
Bookmark and Share
 
Probabilistic Algorithms (Including Monte Carlo) (G.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Probabilistic Algorithms (Including Monte Carlo)": Date

Type: Article
Jul 1 1987
On iterative methods in Markov modelling
Schatte P. Journal of Information Processing and Cybernetics 23(1): 49-51, 1987. Type: Article
Oct 1 1987
Finite-data algorithms for approximate stochastic realization
Vaccaro R., Kluwer B.V., Deventer, The Netherlands, 1986. Type: Book (9789780898381771)
Jul 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy