Now showing items 1-1 of 1

    • Instance complexity 

      Ko, Ker-I; Orponen, Pekka; Schöning, Uwe; Watanabe, Osamu
      We introduce a measure for the computational complexity of individual instances of a decision problern and study some of its properties. The inntance complexity of a string x with respect to a set A and time bound t, ic ...