Probabilistic recurrence relations revisited

Author： Chaudhuri S.   Dubhashi D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.181, Iss.1, 1997-07, pp. : 45-56

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Multi-level decomposition of probabilistic relations

By Grygiel Stanislaw   Zwick Martin   Perkowski Marek  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 33, Iss. 5-6, 2004-05 ,pp. : 948-961

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

An asymptotic theory for recurrence relations based on minimization and maximization

By Hwang H.-K.   Tsai T.-H.  

Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. : 1475-1501

Elsevier

Access to resources Recommend Favorite

Queries revisited

By Angluin D.  

Theoretical Computer Science, Vol. 313, Iss. 2, 2004-02 ,pp. : 175-194

Elsevier

Access to resources Recommend Favorite

ebrary Revisited

By Magedanz Stacy  

The Charleston Advisor, Vol. 6, Iss. 2, 2004-10 ,pp. : 18-18

The Charleston Company

Access to resources Recommend Favorite

Continuations Revisited

By Wadsworth C.P.  

LISP and Symbolic Computation, Vol. 13, Iss. 1-2, 2000-04 ,pp. : 131-133

Springer Publishing Company

Access to resources Recommend Favorite