• DocumentCode
    3359380
  • Title

    Complexity classes and sparse oracles

  • Author

    Bovet, D.P. ; Crescenzi, P. ; Silvestri, R.

  • Author_Institution
    Dept. of Math., Rome Univ., Italy
  • fYear
    1991
  • fDate
    30 Jun-3 Jul 1991
  • Firstpage
    102
  • Lastpage
    108
  • Abstract
    The authors obtain positive relativization results. In particular, the goal is to prove statements of the kind: `Given two complexity classes C1 and C2, C 1=C2 if and only if for every sparse set S, C1S=C2 S.´ The authors derive a sufficient condition to obtain such results and, as an application, they prove a general theorem from which, as far as they know, all of the results obtained previously along with new ones can be immediately derived
  • Keywords
    computational complexity; complexity classes; sparse oracles; sparse set; sufficient condition; Computational modeling; Mathematical model; Mathematics; Polynomials; Sufficient conditions; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual
  • Conference_Location
    Chicago, IL
  • Print_ISBN
    0-8186-2255-5
  • Type

    conf

  • DOI
    10.1109/SCT.1991.160248
  • Filename
    160248