Bernd Steinbach

Home * People * Bernd Steinbach



Bernd Steinbach, a German computer scientist and Professor of software technology and programming techniques at the Freiberg University of Mining and Technology in Freiberg, Saxony. His research interest covers the satisfiability problem (SAT) for Logic Equations, also applied to the chess board. In 2012, along with Christian Posthoff, he solved a 4-coloring of 17x17 grids without monochromatic rectangles.

=Selected Publications=

1979

 * Christian Posthoff, Bernd Steinbach (1979). Binäre Gleichungen- Algorithmen und Programme (Logic Equations - Algorithms and Programs) Wissenschaftliche Schriftenreihe der TH Karl-Marx-Stadt, Heft 1/1979.
 * Christian Posthoff, Bernd Steinbach (1979). Binäre dynamische Systeme - Algorithmen und Programme (Binary Dynamic Systems - Algorithms and Programs) Wissenschaftliche Schriftenreihe der TH Karl-Marx-Stadt, Heft 8/1979.

1990 ...

 * Bernd Steinbach, Nico Kümmling (1990). Effiziente Lösung hochdimensionaler BOOLEscher Probleme mittels XBOOLE auf Transputer. Transputer-Anwender-Treffen 1990: 127-134 » Transputer

2000 ...

 * Bernd Steinbach, Christina Dorotska (2000). Orthogonal Block Building Using Ordered Lists of Ternary Vectors. Freiberg University of Mining and Technology, pdf
 * Christian Posthoff, Bernd Steinbach (2004). Logic Functions and Equations. Binary Models for Computer Science, Springer Book
 * Bernd Steinbach, Christian Posthoff (2007). Set-Based SAT-Solving. pdf
 * Bernd Steinbach, Christian Posthoff (2008). Combinatorics on the Chess Board – Solutions using Logic Equations. Workshop Chess and Mathematics, Dresden
 * Christian Posthoff, Bernd Steinbach (2009).  Logic Functions and Equations. Examples and Exercises, Springer Book

2010 ...

 * Christian Posthoff, Bernd Steinbach (2010). The Solution of Discrete Constraint Problems using Boolean Models - The Use of Ternary Vectors for Parallel SAT-Solving. ICAART Vol. 1, pp. 487-493
 * Bernd Steinbach, Christian Posthoff (2011). Improvements of the Construction of Exact Minimal Covers of Boolean Functions. EUROCAST 2011, pp. 272-279
 * Bernd Steinbach, Christian Posthoff (2012). Extremely Complex 4-Colored Rectangle-Free Grids: Solution of Open Multiple-Valued Problems. ISMVL 2012
 * Christian Posthoff, Bernd Steinbach (2014). Solving the Game of Sudoku. ICGA Journal, Vol. 37, No. 2 » Sudoku
 * Christian Posthoff, Bernd Steinbach (2014). How to Solve Bishop-Problems. ICGA Journal, Vol. 37, No. 3

=External Links=
 * Prof. Dr.-Ing. habil. Steinbach - TU Bergakademie Freiberg
 * Bernd Steinbach from Wikipedia.de (German)
 * Boolescher Differentialkalkül from Wikipedia.de (German)
 * Computational Complexity: The 17x17 problem SOLVED! (also 18x18) by Bill Gasarch, February 08, 2012
 * 17×17 4-coloring with no monochromatic rectangles | The Math Less Traveled, February 09, 2012

=References=

Up one level