首页> 外文OA文献 >A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

【2h】

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

机译：定向s-t连通性的亚线性空间多项式时间算法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Greg Barnes; Jonathan F. Buss; Walter L. Ruzzo; Baruch Schieber;
展开▼
作者单位

展开▼
年度 1992
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. A sublinear space, polynomial time algorithm for directed s-t connectivity [J] . Barnes G., Ruzzo WL., Schieber B., SIAM Journal on Computing . 1998,第5期

机译：用于有向s-t连通性的亚线性空间多项式时间算法
2. A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs [J] . Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, Electronic Colloquium on Computational Complexity . 2019,第3期

机译：平面图的次线性空间和多项式时间分离器算法
3. An O(n~∈) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs [J] . DIPTARKA CHAKRABORTY, RACHUNATH TEWARI ACM Transactions on Computational Theory . 2017,第4期

机译：有向层平面图中可达性的O（n〜∈）空间和多项式时间算法
4. A sublinear space, polynomial time algorithm for directed s-t connectivity [C] . Barnes, G., Buss, Structure in Complexity Theory Conference, 1992., Proceedings of the Seventh Annual . 1992

机译：用于有向s-t连通性的亚线性空间多项式时间算法
5. Polynomial-time Random Oracles, Nondeterministic Sublinear Time, and Boolean Function Complexity [D] . Sekoni, Adewale. 2018

机译：多项式时间随机Oracle，不确定的亚线性时间和布尔函数复杂度
6. Time-varying MVAR algorithms for directed connectivity analysis: Critical comparison in simulations and benchmark EEG data [O] . Mattia F. Pagnotta, Gijs Plomp 2012

机译：定向连接分析的时变MVAR算法：仿真和基准EEG数据的关键比较
7. A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity [O] . Greg Barnes, Jonathan F. Buss, Walter L. Ruzzo, 1992

机译：定向s-t连通性的亚线性空间多项式时间算法

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

著录项

引文网络

相似文献

相关主题

期刊订阅