• DocumentCode
    1992590
  • Title

    On the structure of complete sets

  • Author

    Buhrman, Harry ; Torenvliet, Leen

  • Author_Institution
    Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain
  • fYear
    1994
  • fDate
    28 Jun- 1 Jul 1994
  • Firstpage
    118
  • Lastpage
    133
  • Abstract
    The many types of resource-bounded reductions that are both an object of study and a research tool in structural complexity theory have given rise to a large variety of completeness notions. A complete set in a complexity class is a manageable object that represents the structure of the entire class. The study of its structure can reveal properties that are general in that the complexity class, and the study of the structure of complete sets in different classes, can reveal secrets about the relation between these classes. Research into all sorts of aspects and properties of complete sets has been and will be a major topic in structural complexity theory. In this expository paper, we review the progress that has been made in recent years on selected topics in the study of complete sets
  • Keywords
    computational complexity; set theory; complete sets; completeness; complexity class; manageable object; resource-bounded reductions; structural complexity theory; Complexity theory; Forward contracts; Informatics; Polynomials; TV;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
  • Conference_Location
    Amsterdam
  • Print_ISBN
    0-8186-5670-0
  • Type

    conf

  • DOI
    10.1109/SCT.1994.315811
  • Filename
    315811