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 design, are used here ... more >>>

We show that a fully polynomial time approximation scheme given for an optimization problem can always be simply modified to a polynomial time algorithm solving the problem optimally if the computation model is the deterministic Turing Machine or the logarithmic cost RAM and if the range of the error bound ... more >>>