Superpolynomial circuits, almost sparse oracles and the exponential hierarchy-Reference-Cited by-同舟云学术

Superpolynomial circuits, almost sparse oracles and the exponential hierarchy

Published:1992 Issue: Volume: Page:116-127
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Buhrman Harry,Homer Steven

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56287-7_99.pdf

Reference16 articles.

1. Allender E. & O. Watanabe. Kolmogorov Complexity and Degrees of Tally Sets. Proc. Structure in Complexity Theory third annual conference, IEEE Computer Society Press (1988).

2. Babai L., L. Fortnow & C. Lund. Non-deterministic exponential time has twoprover interactive protocols. Proc. 31st IEEE Symp. on Foundations of Computer Science, (1990) pp16–25.

3. Balcázar J.L. Self-reducibilityi. Journal of Computer and System Sciences 41 (1990) pp367–388.

4. Balcázar J.L., J. Díaz & J. Gabarró. Structural Complexity I. W. Brauer, G. Rozenberg & A. Salomaa (eds.) EATCS Monographs on Theoretical Computer Science 11 (1988) Springer Verlag.

5. Feige U., S. Goldwasser, L. Lovász, S. Safra & M. Szegedy Approximating Clique is Almost NP-complete. Manuscript.

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

1. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03

2. On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2023-09-30

3. The Power of Natural Properties as Oracles;computational complexity;2023-07-06

4. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman;Fundamentals of Computation Theory;2023

5. Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds;Automata, Languages and Programming;2011