Home * People * Bernd Steinbach
b_steinb.jpg

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 [1], also applied to the chess board [2]. In 2012, along with Christian Posthoff, he solved a 4-coloring of 17x17 grids without monochromatic rectangles [3] [4] [5] [6] [7].
Bernd Steinbach [8]

Selected Publications

[9] [10]

1979

1990 ...

2000 ...

2010 ...


External Links


References

  1. ^ Workshops Boolean Problems
  2. ^ Bernd Steinbach, Christian Posthoff (2008). Combinatorics on the Chess Board – Solutions using Logic Equations. Workshop Chess and Mathematics
  3. ^ Bernd Steinbach, Christian Posthoff (2012). Extremely Complex 4-Colored Rectangle-Free Grids: Solution of Open Multiple-Valued Problems. ISMVL 2012
  4. ^ Computational Complexity: The 17x17 challenge. Worth $289.00. This is not a joke by Bill Gasarch, November 30, 2009
  5. ^ Computational Complexity: The 17x17 problem SOLVED! (also 18x18) by Bill Gasarch, February 08, 2012
  6. ^ 17×17 4-coloring with no monochromatic rectangles | The Math Less Traveled, February 09, 2012
  7. ^ Lösung des Vierfarbenrätsels: Drei Ecken dürft ihr bilden by Holger Dambeck, Spiegel Online, February 22, 2012 (German)
  8. ^ Homepage Prof. Steinbach
  9. ^ Prof. Steinbach Publikationen
  10. ^ DBLP: Bernd Steinbach
  11. ^ CHESS AND MATHEMATICS - Workshop Dresden, 21st - 23rd November 2008
  12. ^ Workshop Chess and Mathematics (pdf) agenda and abstracts

What links here?


Up one level