ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > KNIGHT'S TOURS:
Reports tagged with knight's tours:
TR95-047 | 5th October 1995
Martin Loebbing, Ingo Wegener

The Number of Knight's Tours Equals 33,439,123,484,294 -- Counting with Binary Decision Diagrams

An increasing number of results in graph theory, combinatorics and
theoretical computer science is obtained with the help of computers,
e.g. the proof of the Four Colours Theorem or the computation of
certain Ramsey numbers. Binary decision diagrams, known as tools in
hardware verification and computer-aided ... more >>>




ISSN 1433-8092 | Imprint