This book constitutes the refereed proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005. The 62 revised full papers presented together with full papers or abstracts of 7 invited talks were carefully reviewed and selected from 137 submissions. All current aspects in theoretical computer science are addressed, ranging from quantum computing, approximation, automata, circuits, scheduling, games, languages, discrete mathematics, combinatorial optimization, graph theory, networking, algorithms, and complexity to programming theory, formal methods, and mathematical logic.Complexity of generalized satisfiability counting problems. Information and ... Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics. SIAM, 2001. [Coo71] S. Cook. ... More complicated questions about maxima and minima, and some closures of NP.
|Title||:||Mathematical Foundations of Computer Science 2005|
|Author||:||Joanna Jedrzejowicz, Andrzej Szepietowski|
|Publisher||:||Springer Science & Business Media - 2005-08-17|