MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Resource-bounded instance complexity (1996) [19 citations — 8 self]

Download:
Download as a PDF | Download as a PS
by Lance Fortnow, Martin Kummer
Theoretical Computer Science A
http://external.nj.nec.com/homepages/fortnow/papers/./instance.ps
Add To MetaCart

Abstract:

The instance complexity of a string x with respect to a set A and time bound t, ic t (x: A), is the length of the shortest program for A that runs in time t, decides x correctly, and makes no mistakes on other strings (where "don't know" answers are permitted). The Instance Complexity Conjecture of Ko, Orponen, Schoning, and Watanabe states that for every recursive set A not in P and every polynomial t there is a polynomial t 0 and a constant c such that for infinitely many x, ic t

Citations

1588 Computational Complexity – Papadimitriou - 1994
1083 Introduction to Kolmogorov Complexity and Its Applications – Li, Vitanyi - 1993
159 Structural Complexity I – Balc'azar, D'iaz, et al. - 1988
120 A Complexity Theoretic Approach to Randomness – Sipser - 1983
84 P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP – Selman - 1979
62 Category and measure in complexity classes – Lutz - 1990
55 Almost every set in exponential time is P-bi-immune – Mayordomo - 1994
48 Generalized Kolmogorov complexity and the structure of feasible computations – Hartmanis - 1983
45 P-selective sets and reducing search to decision vs. self-reducibility – Hemaspaandra, Naik, et al. - 1996
38 Structural Complexity II – Balcazar, Diaz, et al. - 1990
33 Polynomial terse sets – Amir, Gasarch - 1988
26 Instance complexity – Orponen, Ko, et al. - 1994
21 On the notion of infinite pseudorandom sequences – Ko - 1986
19 On reductions of NP sets to sparse sets – Homer, Longpr'e - 1994
16 Kolmogorov complexity and instance complexity of recursively enumerable sets – Kummer - 1996
10 Random strings make hard instances – Buhrman, Orponen - 1994
7 A note on the instance complexity of pseudorandom sets – Ko - 1992
7 What is a hard instance of a computational problem – Ko, Orponen, et al. - 1986
5 On the instance complexity of NP-hard problems – Orponen - 1990
3 On sparse sets in NP\GammaP – Hartmanis - 1983
3 On symmetry of information and polynomial time invertibility – Longpr'e, Watanabe - 1993
3 On one-one polynomial time equivalence relations. Theoretical Computer Science 38:157--165 – Watanabe - 1985
2 Promises and fault-tolerant database access. In: Complexity Theory. Edited by – Cai, Hemachandra, et al. - 1993
2 Random strings make instances hard. To appear in – Buhrman, Orponen - 1994
View or Download | Add to My Collection | Correct Errors