Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

· Lecture Notes in Logic 47. књига · Cambridge University Press
Π•-књига
554
Π‘Ρ‚Ρ€Π°Π½ΠΈΡ†Π°
ΠžΡ†Π΅Π½Π΅ ΠΈ Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΡ˜Π΅ нису Π²Π΅Ρ€ΠΈΡ„ΠΈΠΊΠΎΠ²Π°Π½Π΅ Β Π‘Π°Π·Π½Π°Ρ˜Ρ‚Π΅ вишС

О овој С-књизи

Descriptive complexity theory establishes a connection between the computational complexity of algorithmic problems (the computational resources required to solve the problems) and their descriptive complexity (the language resources required to describe the problems). This groundbreaking book approaches descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory. It develops a 'definable structure theory' concerned with the logical definability of graph theoretic concepts such as tree decompositions and embeddings. The first part starts with an introduction to the background, from logic, complexity, and graph theory, and develops the theory up to first applications in descriptive complexity theory and graph isomorphism testing. It may serve as the basis for a graduate-level course. The second part is more advanced and mainly devoted to the proof of a single, previously unpublished theorem: properties of graphs with excluded minors are decidable in polynomial time if, and only if, they are definable in fixed-point logic with counting.

О Π°ΡƒΡ‚ΠΎΡ€Ρƒ

Martin Grohe is a Professor of Theoretical Computer Science at RTWH Aachen University, Germany, where he holds the Chair for Logic and the Theory of Discrete Systems. His research interests are in theoretical computer science interpreted broadly, including logic, algorithms and complexity, graph theory, and database theory.

ΠžΡ†Π΅Π½ΠΈΡ‚Π΅ ΠΎΠ²Ρƒ Π΅-ΠΊΡšΠΈΠ³Ρƒ

ΠˆΠ°Π²ΠΈΡ‚Π΅ Π½Π°ΠΌ својС ΠΌΠΈΡˆΡ™Π΅ΡšΠ΅.

Π˜Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΡ˜Π΅ ΠΎ Ρ‡ΠΈΡ‚Π°ΡšΡƒ

ΠŸΠ°ΠΌΠ΅Ρ‚Π½ΠΈ Ρ‚Π΅Π»Π΅Ρ„ΠΎΠ½ΠΈ ΠΈ Ρ‚Π°Π±Π»Π΅Ρ‚ΠΈ
Π˜Π½ΡΡ‚Π°Π»ΠΈΡ€Π°Ρ˜Ρ‚Π΅ Π°ΠΏΠ»ΠΈΠΊΠ°Ρ†ΠΈΡ˜Ρƒ Google Play књигС Π·Π° Android ΠΈ iPad/iPhone. Аутоматски сС ΡΠΈΠ½Ρ…Ρ€ΠΎΠ½ΠΈΠ·ΡƒΡ˜Π΅ са Π½Π°Π»ΠΎΠ³ΠΎΠΌ ΠΈ ΠΎΠΌΠΎΠ³ΡƒΡ›Π°Π²Π° Π²Π°ΠΌ Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ онлајн ΠΈ ΠΎΡ„Π»Π°Ρ˜Π½ Π³Π΄Π΅ Π³ΠΎΠ΄ Π΄Π° сС Π½Π°Π»Π°Π·ΠΈΡ‚Π΅.
Π›Π°ΠΏΡ‚ΠΎΠΏΠΎΠ²ΠΈ ΠΈ Ρ€Π°Ρ‡ΡƒΠ½Π°Ρ€ΠΈ
ΠœΠΎΠΆΠ΅Ρ‚Π΅ Π΄Π° ΡΠ»ΡƒΡˆΠ°Ρ‚Π΅ Π°ΡƒΠ΄ΠΈΠΎ-књигС ΠΊΡƒΠΏΡ™Π΅Π½Π΅ Π½Π° Google Play-Ρƒ ΠΏΠΎΠΌΠΎΡ›Ρƒ Π²Π΅Π±-ΠΏΡ€Π΅Π³Π»Π΅Π΄Π°Ρ‡Π° Π½Π° Ρ€Π°Ρ‡ΡƒΠ½Π°Ρ€Ρƒ.
Π•-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ ΠΈ Π΄Ρ€ΡƒΠ³ΠΈ ΡƒΡ€Π΅Ρ’Π°Ρ˜ΠΈ
Π”Π° бистС Ρ‡ΠΈΡ‚Π°Π»ΠΈ Π½Π° ΡƒΡ€Π΅Ρ’Π°Ρ˜ΠΈΠΌΠ° којС користС Π΅-мастило, ΠΊΠ°ΠΎ ΡˆΡ‚ΠΎ су Kobo Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ, Ρ‚Ρ€Π΅Π±Π° Π΄Π° ΠΏΡ€Π΅ΡƒΠ·ΠΌΠ΅Ρ‚Π΅ Ρ„Π°Ρ˜Π» ΠΈ прСнСсСтС Π³Π° Π½Π° ΡƒΡ€Π΅Ρ’Π°Ρ˜. ΠŸΡ€Π°Ρ‚ΠΈΡ‚Π΅ Π΄Π΅Ρ‚Π°Ρ™Π½Π° упутства ΠΈΠ· Ρ†Π΅Π½Ρ‚Ρ€Π° Π·Π° ΠΏΠΎΠΌΠΎΡ› Π΄Π° бистС ΠΏΡ€Π΅Π½Π΅Π»ΠΈ Ρ„Π°Ρ˜Π»ΠΎΠ²Π΅ Ρƒ ΠΏΠΎΠ΄Ρ€ΠΆΠ°Π½Π΅ Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡Π΅.

НаставитС Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ ΡΠ΅Ρ€ΠΈΡ˜Π°Π»

Још ΠΎΠ΄ Π°ΡƒΡ‚ΠΎΡ€Π° Martin Grohe

Π‘Π»ΠΈΡ‡Π½Π΅ Π΅-књигС