Dimension, Halfspaces, and the Density of Hard Sets
暂无分享,去创建一个
[1] Jack H. Lutz,et al. Measure, Stochasticity, and the Density of Hard Languages , 1993, STACS.
[2] Bin Fu. With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets , 1995, SIAM J. Comput..
[3] John M. Hitchcock. Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets , 2006, STACS.
[4] Jack H. Lutz,et al. Effective Strong Dimension, Algorithmic Information, and Computational Complexity , 2002, ArXiv.
[5] Lane A. Hemaspaandra,et al. Reductions to Sets of Low Information Content , 1992, Complexity Theory: Current Research.
[6] Jack H. Lutz,et al. Almost everywhere high nonuniform complexity , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[7] V. Rich. Personal communication , 1989, Nature.
[8] Jack H. Lutz,et al. Twelve Problems in Resource-Bounded Measure , 1999, Bull. EATCS.
[9] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[10] Wolfgang Lindner. Resource-Bounded Measure and Learnability , 2000, Theory of Computing Systems.
[11] Yong Zhao,et al. The Density of Weakly Complete Problems under Adaptive Reductions , 2000, SIAM J. Comput..
[12] Lane A. Hemaspaandra. SIGACT news complexity theory column 48 , 2005, SIGA.
[13] Jack H. Lutz,et al. The quantitative structure of exponential time , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[14] Vikraman Arvind,et al. Geometric Sets of Low Information Content , 1996, Theor. Comput. Sci..
[15] Wolfgang Maass,et al. How fast can a threshold gate learn , 1994, COLT 1994.
[16] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[17] Osamu Watanabe,et al. Polynomial time reducibility to a set of small density , 1987, SCT.
[18] Jack H. Lutz,et al. Dimension in complexity classes , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.