The complexity of sparse sets in P

This publication has 18 references indexed in Scilit:

• On some "non-uniform" complexity measures
  Published by Springer Nature ,2006
• Complexity Measures For Public-Key Cryptosystems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Log Depth Circuits For Division And Related Problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Parallel Powering
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• Compression and ranking
  Published by Association for Computing Machinery (ACM) ,1985
• Generalized Kolmogorov complexity and the structure of feasible computations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Sparse sets in NP-P
  Published by Association for Computing Machinery (ACM) ,1983
• Comparison of the active visiting and the crossing complexities
  Lecture Notes in Computer Science, 1977
• The contextsensitivity bounds of contextsensitive grammars and languages
  Published by Springer Nature ,1977
• On one-way Auxiliary pushdown automata
  Published by Springer Nature ,1977