P. Orponen. A classification of complexity core lattices. Theoretical Computer Science, 70:121--130, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Instance Complexity - Orponen, Ko, Schöning, Watanabe (1994) (25 citations) Self-citation (Orponen) (Correct)
....A. A set S is almost t coverable within A if there is a set E A; E 2 DTIME(t) such that for any other E 0 A; E 0 2 DTIME(t) the set (E 0 Gamma E) S is finite. The notion of almost t coverability is a generalization of the notion of almost t immunity discussed (for polynomial t) in [24], and under the name non t levelability in [25] A set A is almost t immune if it contains a DTIME(t) subset E that is maximal in the sense that for any other E 0 A, E 0 2 DTIME(t) the set E 0 Gamma E is finite. Hence A is almost t immune if and only if it is almost t coverable within ....
Orponen, P. A classification of complexity core lattices. Theoret. Comput. Sci. 47 (1986), 121--130.
Hard Instances of Hard Problems - Lutz, Mhetre, Srinivasan (Correct)
No context found.
P. Orponen. A classification of complexity core lattices. Theoretical Computer Science, 70:121--130, 1986.
Completeness and Weak Completeness under Polynomial-Size Circuits - Juedes, Lutz (1996) (1 citation) (Correct)
No context found.
P. Orponen, A classification of complexity core lattices, Theoretical Computer Science 70 (1986), pp. 121--130.
Kolmogorov Complexity, Complexity Cores, and the Distribution.. - Juedes, Lutz (Correct)
No context found.
P. Orponen. A classification of complexity core lattices. Theoretical Computer Science 70:121--130, 1986.
The Quantitative Structure of Exponential Time - Lutz (1993) (54 citations) (Correct)
No context found.
P. Orponen, A classification of complexity core lattices, Theoretical Computer Science 70 (1986), pp. 121--130.
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