- 2004
- Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 - 2003
- Steffen Reith, Heribert Vollmer:
Optimal satisfiability for propositional calculi and constraint satisfaction problems. Inf. Comput. 186(1): 1-19 (2003) - Steffen Reith:
On the Complexity of Some Equivalence Problems for Propositional Calculi. MFCS 2003: 632-641 - Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003) - 2002
- Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426 - Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002) - 2001
- Steffen Reith:
Generalized satisfiability problems. Julius Maximilians University Würzburg, Germany, 2001 - Steffen Reith, Klaus W. Wagner:
On boolean lowness and boolean highness. Theor. Comput. Sci. 261(2): 305-321 (2001) - Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer:
A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M 2001: 52-59 - 2000
- Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000) - Christian Glaßer, Steffen Reith, Heribert Vollmer:
The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178 - Steffen Reith, Heribert Vollmer:
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems. MFCS 2000: 640-649 - 1998
- Steffen Reith, Klaus W. Wagner:
On Boolean Lowness and Boolean Highness. COCOON 1998: 147-156 - Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. CoRR cs.CC/9809116 (1998) - Steffen Reith, Heribert Vollmer:
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. Electron. Colloquium Comput. Complex. TR98 (1998)