A complexity theory for feasible closure properties-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A complexity theory for feasible closure properties

Published:1993-06 Issue:3 Volume:46 Page:295-325
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Ogiwara Mitsunori,Hemachandra Lane A.

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference55 articles.

1. Recognizing primes in random polynomial time;Adleman,1987

2. Lower bounds for the low hierarchy;Allender;J. Assoc. Comput. Mach.,1992

3. Sublattices of the polynomial time degrees;Ambos-Spies;Inform. and Control,1985

4. Polynomial interpolation, threshold circuits, and the polynomial hierarchy;Beigel,1989

5. Counting classes: Thresholds, parity, mods, and fewness;Beigel,1990

Cited by 67 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Clause-connected versions of the satisfiability problem;SIB ELECTRON MATH RE;2024

2. On the Power of Counting the Total Number of Computation Paths of NPTMs;Lecture Notes in Computer Science;2024

3. Parameterised Counting in Logspace;Algorithmica;2023-04-21

4. Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata;Fundamentals of Computation Theory;2023

5. What is in #P and what is not?;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP