The complexity of sparse sets in P-Reference-Cited by-同舟云学术

The complexity of sparse sets in P

Published:1986 Issue: Volume: Page:1-11
ISSN:0302-9743
Container-title:Structure in Complexity Theory
language:
Short-container-title:

Author:

Allender Eric W.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-16486-3_85

Reference33 articles.

1. E. W. Allender, Invertible functions, Doctoral Dissertation, Georgia Institute of Technology.

2. E. W. Allender, Characterizations of PUNC and precomputation, to be presented at the 13th International Colloquium on Automata, Languages and Programming, and will appear in Lecture Notes in Computer Science.

3. E. W. Allender, Isomorphisms and 1L reductions, These Proceedings.

4. J. L. Balcazar and R. V. Book, Sets with small generalized Kolmogorov complexity, Technical Report MSRI 00918-86, Mathematical Sciences Research Institute, Berkeley.

5. J. L. Balcazar, J. Diaz, J. Gabarro, On some “non-uniform” complexity measures, 5th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 199, pp. 18–27.

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

1. Impossibilities in Succinct Arguments: Black-Box Extraction and More;Progress in Cryptology - AFRICACRYPT 2023;2023

2. Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata;Lecture Notes in Computer Science;2022

3. The Untold Story of $$\mathsf {SBP}$$;Computer Science – Theory and Applications;2020

4. On the power of unambiguity in log-space;computational complexity;2012-09-25

5. A second step towards circuit complexity-theoretic analogs of Rice's theorem;Mathematical Foundations of Computer Science 1998;1998