| K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. E#ective strong dimension, algorithmic information, and computational complexity. SIAM Journal on Computing. To appear. Preliminary version appeared in Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, pages 632-643, 2004. |
No context found.
K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. E#ective strong dimension, algorithmic information, and computational complexity. SIAM Journal on Computing. To appear. Preliminary version appeared in Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, pages 632-643, 2004.
No context found.
K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. E#ective strong dimension, algorithmic information, and computational complexity. SIAM Journal on Computing. To appear. Preliminary version appeared in Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, pages 632-643, 2004.
No context found.
J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Scaled dimension and nonuniform complexity. Journal of Computer and System Sciences. To appear. Preliminary version appeared in Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, pages 278--290, 2003.
No context found.
J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. Scaled dimension and nonuniform complexity. Journal of Computer and System Sciences. To appear. Preliminary version appeared in Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, pages 278-290, 2003.
No context found.
J. M. Hitchcock. Correspondence principles for eective dimensions. Theory of Computing Systems. To appear. Preliminary version appeared in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, pages 561-571, 2002.
No context found.
K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. E#ective strong dimension, algorithmic information, and computational complexity. SIAM Journal on Computing. To appear. Preliminary version appeared in Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, pages 632-643, 2004.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC