Counting classes and the fine structure between <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mstyle mathvariant="sans-serif"><mml:mi>N</mml:mi></mml:mstyle><mml:msup><mml:mrow><mml:mstyle mathvariant="sans-serif"><mml:mi>C</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math> and <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mstyle mathvariant="sans-serif"><mml:mi>L</mml:mi></mml:mstyle></mml:math>-Reference-Cited by-同舟云学术

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

Counting classes and the fine structure between NC1 and L

Published:2012-02 Issue: Volume:417 Page:36-49
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Datta Samir,Mahajan Meena,Raghavendra Rao B.V.,Thomas Michael,Vollmer Heribert

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. The complexity of matrix rank and feasible systems of linear equations;Allender;Computational Complexity,1999

2. Arithmetic circuits and counting complexity classes;Allender,2004

3. Relationships among PL, #L, and the determinant;Allender;RAIRO Theoretical Information and Applications,1996

4. Bounded-width polynomial size branching programs recognize exactly those languages in NC1;Barrington;Journal of Computer and System Sciences,1989

5. PP is closed under intersection;Beigel;Journal of Computer and System Sciences,1995

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

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

2. Guest Column;ACM SIGACT News;2023-02-28

3. Parameterised Counting in Logspace;LEIBNIZ INT PR INFOR;2021

4. On Measures of Space over Real and Complex Numbers;Lecture Notes in Computer Science;2020

5. Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs;Mathematical Foundations of Computer Science 2012;2012

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP