High Sets for NP

Johannes Köbler () and Uwe Schöning ()
Additional contact information
Johannes Köbler: Universität Ulm, Abt. Theoretische Informatik
Uwe Schöning: Universität Ulm, Abt. Theoretische Informatik

A chapter in Advances in Algorithms, Languages, and Complexity, 1997, pp 139-156 from Springer

Abstract: Abstract We consider sets that are high for the complexity class NP with respect to several operators on complexity classes. The notion of lowness and highness in the context of complexity theory was introduced by Schüning [34] and further investigated and generalized under several aspects (see [24, 7, 9, 37, 22, 20, 27, 4, 31, 25, 26]).

Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-3394-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9781461333944

DOI: 10.1007/978-1-4613-3394-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().