RL $$ \subseteq $$ SC
Author:
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Link
http://link.springer.com/content/pdf/10.1007/BF01205052.pdf
Reference7 articles.
1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovasz, and C. Rackoff, Random walks, universal sequences and the complexity of maze problems. In 20 th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1979, 218?223.
2. G. Barnes, and W. L. Ruzzo, Deterministic algorithms for undirecteds-t connectivity using polynomial time and sublinear space. InProceedings of the 23 rd Annual ACM Symposium on Theory of Computing, 1991, 43?53.
3. A. Borodin, S.A. Cook, P.W. Dymond, W.L. Ruzzo, andM. Tompa, Two applications of inductive counting for complementation problems.SIAM J. Comput. 18(3) (1989), 559?578.
4. L. Carter andM. Wegman, Universal hash functions.J. Comput. System Sci. 18(2) (1979), 143?154.
5. N. Nisan, Pseudorandom generators for space-bounded computation.Combinatorica 12(4) (1992), 449?461.
Cited by 99 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Opening Up the Distinguisher: A Hardness to Randomness Approach for BPL=L That Uses Properties of BPL;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Approximating Iterated Multiplication of Stochastic Matrices in Small Space;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel;Random Structures & Algorithms;2023-04-15
4. Degree 2 Boolean Functions on Grassmann Graphs;The Electronic Journal of Combinatorics;2023-02-10
5. Relationships between the number of inputs and other complexity measures of Boolean functions;DISCRETE ANAL;2022
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3