首页 | 本学科首页   官方微博 | 高级检索  
     


On some conditioning results in the probabilistic analysis of algorithms
Authors:Colin McDiarmid
Affiliation:Institute of Economics and Statistics, Oxford, U.K.
Abstract:A simple combinatorial approach is given for handling certain conditioning problems that arise in the probabilistic analysis of graph algorithms.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号