Searching for "Instance Complexity." – sorted by Relevance.
-
Instance Complexity
- Instance Complexity Pekka Orponen University of Helsinki, Finland Ker--I Ko State University
- Cited by 25 (1 self) – Add To MetaCart
-
On Resource-Bounded Instance Complexity
- On Resource-Bounded Instance Complexity Lance Fortnow y University of Chicago Martin Kummer z
- Cited by 20 (9 self) – Add To MetaCart
-
Kolmogorov complexity and instance complexity of recursively enumerable sets
- arXiv:math/9405208v1 [math.LO] 25 May 1994 Kolmogorov Complexity and Instance Complexity
- Cited by 18 (1 self) – Add To MetaCart
-
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
- Nondeterministic Instance Complexity and Hard-to-Prove Tautologies V. Arvind 1 , J. Kobler 2
- Add To MetaCart
-
On Hard Instances
- Abstract Instance complexity was introduced by Orponen, Ko, Schoning, and Watanabe [14] as a measure
- Cited by 2 (1 self) – Add To MetaCart
-
Hard Instances of Hard Problems
- the instance complexities of problems that are hard or weakly hard for exponential time under polynomial time
- Add To MetaCart
-
Random Strings Make Hard Instances
- establish the truth of the "instance complexity conjecture" in the case of DEXT-complete sets w
- Cited by 11 (2 self) – Add To MetaCart
-
Random Strings Make Hard Instances
- establish the truth of the "instance complexity conjecture" in the case of DEXT-complete sets w
- Add To MetaCart
-
Density Condensation of Boolean Formulas
- not give us any information about the complexity of each individual instance. It is also true, however
- Cited by 1 (0 self) – Add To MetaCart
-
Reductions to Sets of Low Information Content (Extended Abstract)
- characterization of the sets of low instance complexity in terms of reductions to tally sets; it follows that if P
- Add To MetaCart

