Ist P = NP? Einführung in die Theorie der NP-Vollständigkeit von Reith, Steffen, Vollmer, Heribert 1964-

Generalized satisfiability problems von Reith, Steffen

A note on closure properties of logspace MOD classes von Hertrampf, Ulrich, Reith, Steffen, Vollmer, Heribert 1964-

On high and low sets for the Boolean hierarchy von Reith, Steffen, Wagner, Klaus W.

Optimal satisfiability for propositional calculi and constraint satisfaction problems von Reith, Steffen, Vollmer, Heribert 1964-

The complexity of base station positioning in cellular networks von Glaßer, Christian 1973-, Reith, Steffen, Vollmer, Heribert 1964-

Approximation algorithms for cellular network optimization von Glaßer, Christian 1973-, Reith, Steffen, Vollmer, Heribert 1964-

The complexity of computing optimal assignments of generalized propositional formulae von Reith, Steffen, Vollmer, Heribert 1964-

Generalized satisfiability problems von Reith, Steffen

Inhaltsverzeichnis

The complexity of problems defined by boolean circuits von Reith, Steffen, Wagner, Klaus W.

The complexity of problems defined by subclasses of boolean functions von Reith, Steffen, Wagner, Klaus W.

On Boolean lowness and Boolean highness von Reith, Steffen, Wagner, Klaus W.