Add to ORKG2. Overview of Complexity Classes below $\mathrm{P} $ 2 2.1. Definitions and basic notions 2.2. Some results on logspace classe
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Bounded arithmetic is a branch of mathematical logic which characterize various classes of computati...
TIB: RN 4237 (200) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...
. We refine the techniques of Beigel, Gill, Hertrampf [4] who investigated polynomial time counting ...
We refine the techniques of Beigel, Gill, Hertrampf (BGH90) who investigated polynomial time countin...
AbstractA programming approach to computability and complexity theory yields more natural definition...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
(eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P,...
The complexity class Full-P/log, corresponding to a form of logarithmic advice for polynomial time, ...
The topics for this course cover various aspects of complexity theory, such as  the basic ...
The complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic ...
We constructively prove the existence of almost complete problems under logspace many-one reduction ...
This paper shows that classical results about complexity classes involving "delayed diagonaliza...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Bounded arithmetic is a branch of mathematical logic which characterize various classes of computati...
TIB: RN 4237 (200) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...
. We refine the techniques of Beigel, Gill, Hertrampf [4] who investigated polynomial time counting ...
We refine the techniques of Beigel, Gill, Hertrampf (BGH90) who investigated polynomial time countin...
AbstractA programming approach to computability and complexity theory yields more natural definition...
We introduce an imperative programming language equipped with variables of higher types. Fragments o...
(eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P,...
The complexity class Full-P/log, corresponding to a form of logarithmic advice for polynomial time, ...
The topics for this course cover various aspects of complexity theory, such as  the basic ...
The complexity classes P/log and Full-P/log, corresponding to the two standard forms of logarithmic ...
We constructively prove the existence of almost complete problems under logspace many-one reduction ...
This paper shows that classical results about complexity classes involving "delayed diagonaliza...
Motivated by the question of how to define an analog of interactive proofs in the setting of logarit...
AbstractHigher type primitive recursive definitions (also known as Gödel's system T) defining first-...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Bounded arithmetic is a branch of mathematical logic which characterize various classes of computati...
TIB: RN 4237 (200) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliot...