Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory-Reference-Cited by-同舟云学术

Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory

Published:1992 Issue: Volume: Page:4-22
ISSN:
Container-title:Kolmogorov Complexity and Computational Complexity
language:
Short-container-title:

Author:

Allender Eric

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-77735-6_2.pdf

Reference58 articles.

1. E. Allender. Invertible Functions. PhD thesis, Georgia Institute of Technology, 1985.

2. E. Allender. Some consequences of the existence of pseudorandom generators. J. Comput. System Sci. 39:101–124, 1989.

3. E. Allender. The generalized Kolmogorov complexity of sets. In Proc. 4th IEEE Structure in Complexity Theory Conf. pages 186–194, 1989.

4. E. Allender and V, Gore. On strong separations from AC 0 In Proc. Fundamentals of Computation Theory, Springer-Verlag, Lecture Notes in Computer Science 529:1–15, 1991.

5. E. Allender and R. Rubinstein. P-printable sets.SIAM J. Comput. 17:1193–1202,1988.

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

1. Neural network design for data-driven prediction of target geometry for an aerodynamic inverse design algorithm;Journal of Mechanical Science and Technology;2024-06-22

2. Machine learning-accelerated aerodynamic inverse design;Engineering Applications of Computational Fluid Mechanics;2023-07-21

3. A Measuring Method Based on Graph Structure for Decision-Making Complexity in Major Science and Technology Projects;Systems;2023-05-07

4. Avoiding Simplicity is Complex;Theory of Computing Systems;2011-05-19

5. Avoiding Simplicity Is Complex;Programs, Proofs, Processes;2010