Measure One Results in Computational Complexity Theory

Heribert Vollmer and Klaus W. Wagner
Additional contact information
Heribert Vollmer: Universiät Würzburg, Theoretische Informatik
Klaus W. Wagner: Universiät Würzburg, Theoretische Informatik

A chapter in Advances in Algorithms, Languages, and Complexity, 1997, pp 285-312 from Springer

Abstract: Abstract Starting with Bennet and Gill’s seminal paper [13] a whole new research line in complexity theory was opened: the examination of relativized complexity theoretic statements which hold for a measure one set of oracles in the measure defined by putting each string into the oracle with probability 1/2 independent of all other strings (a formal definition is given below).

Keywords: Turing Machine; Complexity Theory; Complexity Class; SIAM Journal; Random Oracle (search for similar items in EconPapers)
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_14

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

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

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 ().