Complete problems for complexity classes A note

On diagonalizations over complexity classes

Fleischhack, H.

January 1985

SIGLETIB: RN 4237 (210) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

Computational complexity

Wagner, Klaus (Prof.)

January 1986

Computational complexity / by K. Wagner and G. Wechsung. - Dordrecht u. a. : Reidel, 1986. - 551 S. ...

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)

Hinrichs, Aicke
Traub, Joseph F.
Wozniakowski, Henryk
Yaroslavtseva, Larisa

January 2016

From 20.09.15 to 25.09.15, the Dagstuhl Seminar 15391 Algorithms and Complexity for Continuous Probl...

The recursion-theoretic structure of complexity classes

Schmidt, D.
Karlsruhe Univ. (T.H.) (Germany, F.R.). Fakultaet fuer Informatik

January 1984

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Separating counting communication complexity classes

Krause, M. (Dortmund Univ. (Germany). Lehrstuhl fuer Informatik 2)
Meinel, C. (Trier Univ. (Germany). Mathematik/Informatik)
Waack, S. (Institut fuer Angewandte Analysis und Stochastik (IAAS), Berlin (Germany))
Damm, C. (Humboldt-Universitaet, Berlin (Germany). Fachbereich Informatik)
Trier Univ. (Germany). Mathematik/Informatik

January 1992

Available from TIB Hannover: RR 1843(92-01) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Techn...

m

Jack H Lutz

August 2015

Aweak completeness phenomenon is investigated in the complexity class E DTIME linear According to...

Logics for complexity classes

Vladimir Naidenko

January 2014

A new syntactic characterization of problems complete via Turing re-ductions is presented. General c...

Complexity of counting the optimal solutions

Miki Hermann
Reinhard Pichler
Technische Universität Wien

August 2015

Following the approach of Hemaspaandra and Vollmer, we can define counting complexity classes #·C fo...

Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)

Grohe, Martin
Koucky, Michal
van Melkebeek, Dieter

January 2011

This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complex...

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)

Keller, Alexander
Kuo, Frances
Neuenkirch, Andreas
Traub, Joseph F.

January 2013

From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Probl...

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)

Cucker, Felipe
Karpinski, Marek
Vorobjov, Nicolai

January 2016

This report documents the program and the outcomes of Dagstuhl Seminar 15242 "Complexity of Symboli...

Complexity of counting the optimal solutions

Hermann, Miki
Pichler, Reinhard

September 2009

AbstractFollowing the approach of Hemaspaandra and Vollmer, we can define counting complexity classe...

Computational complexity of real functions and real numbers

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1986

SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Complexity, bounded rationality and problem solving

Gottinger, Hans Werner

January 1979

Gottinger HW. Complexity, bounded rationality and problem solving. Working Papers. Institute of Math...

The critical complexity of graph properties

Turan, G.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1983

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

On diagonalizations over complexity classes

Fleischhack, H.

January 1985

SIGLETIB: RN 4237 (210) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

Computational complexity

Wagner, Klaus (Prof.)

January 1986

Computational complexity / by K. Wagner and G. Wechsung. - Dordrecht u. a. : Reidel, 1986. - 551 S. ...

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)

Hinrichs, Aicke
Traub, Joseph F.
Wozniakowski, Henryk
Yaroslavtseva, Larisa

January 2016

From 20.09.15 to 25.09.15, the Dagstuhl Seminar 15391 Algorithms and Complexity for Continuous Probl...

The recursion-theoretic structure of complexity classes

Schmidt, D.
Karlsruhe Univ. (T.H.) (Germany, F.R.). Fakultaet fuer Informatik

January 1984

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Separating counting communication complexity classes

Krause, M. (Dortmund Univ. (Germany). Lehrstuhl fuer Informatik 2)
Meinel, C. (Trier Univ. (Germany). Mathematik/Informatik)
Waack, S. (Institut fuer Angewandte Analysis und Stochastik (IAAS), Berlin (Germany))
Damm, C. (Humboldt-Universitaet, Berlin (Germany). Fachbereich Informatik)
Trier Univ. (Germany). Mathematik/Informatik

January 1992

Available from TIB Hannover: RR 1843(92-01) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Techn...

m

Jack H Lutz

August 2015

Aweak completeness phenomenon is investigated in the complexity class E DTIME linear According to...

Logics for complexity classes

Vladimir Naidenko

January 2014

A new syntactic characterization of problems complete via Turing re-ductions is presented. General c...

Complexity of counting the optimal solutions

Miki Hermann
Reinhard Pichler
Technische Universität Wien

August 2015

Following the approach of Hemaspaandra and Vollmer, we can define counting complexity classes #·C fo...

Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121)

Grohe, Martin
Koucky, Michal
van Melkebeek, Dieter

January 2011

This report documents the program and the outcomes of Dagstuhl Seminar 11121 ``Computational Complex...

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)

Keller, Alexander
Kuo, Frances
Neuenkirch, Andreas
Traub, Joseph F.

January 2013

From 23.09.12 to 28.09.12, the Dagstuhl Seminar 12391 Algorithms and Complexity for Continuous Probl...

Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242)

Cucker, Felipe
Karpinski, Marek
Vorobjov, Nicolai

January 2016

This report documents the program and the outcomes of Dagstuhl Seminar 15242 "Complexity of Symboli...

Complexity of counting the optimal solutions

Hermann, Miki
Pichler, Reinhard

September 2009

AbstractFollowing the approach of Hemaspaandra and Vollmer, we can define counting complexity classe...

Computational complexity of real functions and real numbers

Mueller, N.T.
Hagen Fernuniversitaet (Germany)

January 1986

SIGLETIB: RO 5219 (59) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbib...

Complexity, bounded rationality and problem solving

Gottinger, Hans Werner

January 1979

Gottinger HW. Complexity, bounded rationality and problem solving. Working Papers. Institute of Math...

The critical complexity of graph properties

Turan, G.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1983

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

On diagonalizations over complexity classes

Fleischhack, H.

January 1985

SIGLETIB: RN 4237 (210) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbi...

Computational complexity

Wagner, Klaus (Prof.)

January 1986

Computational complexity / by K. Wagner and G. Wechsung. - Dordrecht u. a. : Reidel, 1986. - 551 S. ...

Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)

Hinrichs, Aicke
Traub, Joseph F.
Wozniakowski, Henryk
Yaroslavtseva, Larisa

January 2016

From 20.09.15 to 25.09.15, the Dagstuhl Seminar 15391 Algorithms and Complexity for Continuous Probl...

Complete problems for complexity classes A note

Abstract

Extracted data

Complete problems for complexity classes A note

Abstract

Extracted data

Related items

Related items