Автор: J. Flum

What is a mathematical proof? How can proofs be justified? Are there limitations to provability? To what extent can machines carry out mathe- matical proofs? Only in this century has there been succe …

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, …