Bernd Steinbach

From Chessprogramming wiki
Revision as of 09:27, 16 June 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Bernd Steinbach''' FILE:Bernd Steinbach.jpg|border|right|thumb|link=https://tu-freiberg.de/user/851| Bernd Steinbach <ref>[https://tu-f...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * People * Bernd Steinbach

Bernd Steinbach [1]

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

Selected Publications

[9] [10]

1979

1990 ...

2000 ...

2010 ...

External Links

References

Up one level