WorldCat Identities

Wechsung, Gerd

Overview
Works: 25 works in 79 publications in 2 languages and 560 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Honoree
Classifications: QA267, 511.3
Publication Timeline
.
Most widely held works by Gerd Wechsung
Computational complexity by Klaus Wagner( Book )

22 editions published between 1985 and 2010 in English and German and held by 359 WorldCat member libraries worldwide

Frege Conference 1984 : proceedings of the international conference held at Schwerin, GDR, September 10-14, 1984 by 1984, Schwerin> Frege Conference. <2( Book )

12 editions published between 1984 and 1985 in English and German and held by 101 WorldCat member libraries worldwide

Vorlesungen zur Komplexitätstheorie by Gerd Wechsung( Book )

3 editions published in 2000 in German and held by 44 WorldCat member libraries worldwide

Zur Theorie der subrekursiven Berechenbarkeit by Gerd Wechsung( )

3 editions published in 1974 in German and held by 8 WorldCat member libraries worldwide

On the power of probabilistic polynomial time : P [to the NP(log) power is contained as a subclass within] PP by Richard Beigel( Book )

6 editions published between 1988 and 1989 in English and held by 7 WorldCat member libraries worldwide

Abstract: "We show that probabilistic polynomial time is closed under polynomial-time parity reductions. Therefore every set polynomial-time truth-table reducible to SAT (every set in the [formula] level of the polynomial hierarchy) is accepted by a probabilistic polynomial-time Turing machine. Equivalently, [formula]."
Using randomness to characterize the complexity of computation by Lane A Hemaspaandra( Book )

2 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide

Abstract: "Kolmogorov complexity -- the study of the randomness of strings -- has developed into a fundamental tool in proving lower bounds in computation and in constructing oracles separating complexity classes. In this paper, we show that Kolmogorov complexity is a central tool in the understanding of deterministic and nondeterministic complexity classes and hierarchies; we show that many collapses of computational complexity classes can be completely characterized in terms of Kolmogorov complexity. We discuss P, NP, unique polynomial time, the polynomial hierarchy, and the exponential hierarchy. We show that, for many complexity classes C, C equals a smaller complexity class unless some language in C is accepted only by machines whose execution creates computational structures with a non-trivial degree of randomness. Our fundamental proof technique is a divide and conquer scheme on the tree of potential computational structures."
The operators min and max on the polynomial hierarchy by Harald Hempel( Book )

4 editions published between 1996 and 1997 in English and held by 4 WorldCat member libraries worldwide

Zur Theorie der logarithmischen Integrale by Gerd Wechsung( Book )

3 editions published between 1965 and 1966 in German and held by 4 WorldCat member libraries worldwide

Relating partial and complete solutions and the complexity of computing smallest solutions by André Grosse( Book )

1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide

Query order and self-specifying machines by Lane A Hemaspaandra( Book )

3 editions published between 1995 and 1997 in English and German and held by 4 WorldCat member libraries worldwide

Easy sets and hard certificate schemes by Lane A Hemaspaandra( Book )

3 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide

Abstract: "Can easy sets only have easy certificate schemes? In this paper, we study the class of sets that, for all NP certificate schemes (i.e., NP machines), always have easy acceptance certificates (i.e., accepting paths) that can be computed in polynomial time. We also study the class of sets that, for all NP certificate schemes, infinitely often have easy acceptance certificates. We give structural conditions that control size of these classes."
On the power of #P reductions by Harald Hempel( Book )

2 editions published in 1997 in English and held by 3 WorldCat member libraries worldwide

Time bounded frequency computations by Maren Hinrichs( Book )

1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide

Proceedings at the International Conference held at Schwerin (GDR), Sept. 10 -14, 1984 by 1984, Schwerin) Frege Conference (2( Book )

2 editions published in 1984 in English and held by 2 WorldCat member libraries worldwide

2. Frege Conference : 1984 : proceedings of the International Conference held at Schwerin, Sept. 10-14, 1984( Book )

1 edition published in 1984 in English and held by 1 WorldCat member library worldwide

On the Boolean closure of NP by Gerd Wechsung( Book )

1 edition published in 1985 in German and held by 1 WorldCat member library worldwide

Komplexität, Graphen und Automaten : Gerd Wechsung zum 60. Geburtstag am 12. Februar 1999 by Andreas Brandstädt( Book )

1 edition published in 1999 in German and held by 1 WorldCat member library worldwide

Proceedings of the international conference, held at Schwerin, GDR, September 10-14, 1984 by 1984, Schwerin, Mecklenburg> Frege-Konferenz <2( Book )

1 edition published in 1984 in German and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.75 (from 0.71 for Computatio ... to 0.99 for 2. Frege C ...)

Computational complexity
Alternative Names
Wechsung, G.

Wechsung, G. (Gerd)

Languages
English (53)

German (20)

Covers