Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Reductions to sets of low information content;Arvind,1993
2. On bounded truth-table, conjunctive, and randomized reductions to sparse sets;Arvind,1992
3. V. Arvind, J. Köbler and M. Mundhenk, Upper bounds for the complexity of sparse and tally descriptions, Math. Systems Theory, to appear.
4. Self-reducibility;Balcázar;J. Comput. System Sci.,1990
5. Structural Complexity I,II;Balcázar,1988
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Weights of exact threshold functions;Izvestiya: Mathematics;2021-12-01
2. Learning Reductions to Sparse Sets;Mathematical Foundations of Computer Science 2013;2013
3. Dimension, Halfspaces, and the Density of Hard Sets;Theory of Computing Systems;2010-09-17
4. Weights of Exact Threshold Functions;Mathematical Foundations of Computer Science 2010;2010
5. Dimension, Halfspaces, and the Density of Hard Sets;Lecture Notes in Computer Science