Markus Frick  Home/Search
Context Related
| logik.mathematik.uni...frickdiss.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: logik.mathematik.uni...preprints (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In der Algorithmentheorie ist diese numerische Invariante die vielleicht erfolgreichste Eigenschaft bei der Suche nach einfachen Instanzen f ur normalerweise harte Probleme. In der vorliegenden Arbeit untersuchen wir im wesentlichen zwei Problemarten. In Kapitel 2 verallgemeinern wir Courcelle's Theorem und beschreiben Algorithmen, die f ur Formeln der monadischen zweiten Stufe und Strukturen beschr ankter Baumbreite alle erf ullenden Belegungen, bzw. eine einzelne erf ullende Belegung... (Update)
Context of citations to this paper: More
...while at the same time being general enough to comprise su#ciently rich classes. Examples of nicely locally tree decomposable classes ([9, 12, 11]) 1) Structures of bounded tree width A class of structures of bounded tree width is trivially nicely locally tree...
Cited by: More
Generalized Model-Checking Over Locally Tree-Decomposable Classes - Frick (Correct)
Active bibliography (related documents): More All
0.7: Descriptive Complexity, Lower Bounds and Linear Time - Schwentick (1998) (Correct)
0.3: The Building Blocks of Complexity: A Unified Criterion and.. - Seese, Schlottmann (2003) (Correct)
0.3: Fixed-Point Logics on Planar Graphs - Grohe (1998) (Correct)
Similar documents based on text: More All
0.8: Contributions to the Classification of Tame K*-Groups of Odd.. - Altseimer (1998) (Correct)
0.6: Feature Histograms for Content-Based Image Retrieval - Siggelkow (2002) (Correct)
0.4: Limit Laws for Random Recursive Structures and Algorithms - Neininger (1999) (Correct)
BibTeX entry: (Update)
M. Frick. Easy Instances for Model Checking. PhD thesis, Universitat Freiburg, http://www.freidok.uni-freiburg.de/volltexte/229, 2001. http://citeseer.ist.psu.edu/frick01easy.html More
@misc{ frick01easy,
author = "M. Frick",
title = "Easy Instances for Model Checking",
text = "M. Frick. Easy Instances for Model Checking. PhD thesis, Universitat Freiburg,
http://www.freidok.uni-freiburg.de/volltexte/229, 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/frick01easy.html" }
Citations (may not include all citations):4212 Computers and Intractability - A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
379 The complexity of relational query languages (context) - Vardi - 1982
294 Finite Model Theory (context) - Ebbinghaus, Flum - 1995
232 Optimal implementation of conjunctive queries in relational .. (context) - Chandra, Merlin - 1977
198 Structure and complexity of relational queries - Chandra, Harel - 1982
145 Easy problems for treedecomposable graphs - Arnborg, Lagergren et al. - 1991
143 algorithmic aspects of tree-width (context) - Robertson, Seymour - 1986
131 and logic (context) - Thomas, automata - 1997
127 arboretum of graphs with bounded treewidth (context) - Bodlaender, k- - 1998
116 On local and non-local properties (context) - Gaifman - 1982
104 Graph rewriting: An algebraic and logic approach (context) - Courcelle - 1990
104 Sparse partitions (context) - Awerbuch, Peleg - 1990
82 Treewidth: Algorithmic techniques and results - Bodlaender - 1997
81 Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1995
66 Structural Complexity (context) - Balcazar, Diaz et al. - 1995
55 A linear-time algorithm for nding treedecompositions of smal.. - Bodlaender - 1996
49 Graduate texts in mathematics (context) - Diestel - 1997
47 the complexity of bounded-variable queries (context) - Vardi - 1995
42 Time bounded random access machines (context) - Cook, Reckhow - 1973
41 Diameter and treewidth in minor-closed graph families (context) - Eppstein - 1999
41 Finding approximate separators and computing tree width quic.. (context) - Reed - 1992
35 Monographs in Computer Science (context) - Downey, Fellows - 1999
32 Monotone monadic SNP and constraint satisfaction (context) - Feder, Vardi - 1993
31 Subgraph isomorphism in planar graphs and related problems - Eppstein - 1995
27 Complexity of nding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
20 Graph theory and probability (context) - Erd - 1959
19 the complexity of database queries (context) - Papadimitriou, Yannakakis - 1997
12 Generalized nite automata with an application to a decision .. (context) - Thatcher, Wright - 1968
12 Distance-dependent distributed directories (context) - Peleg - 1993
10 Near-linear cost sequential and distributed constructions of.. - Awerbuch, Berger et al. - 1993
4 Invariance properties of RAMs and linear time (context) - Grandjean - 1994
3 Graph minors III (context) - Robertson, Seymour - 1984
2 the parametric complexity fo relational databases queries an.. (context) - Downey, Fellows et al. - 1996
2 Machine-independent characterizations and complete problems .. (context) - Grandjean, Schwentick - 1999
1 Monadic second-order evaluations over on tree-decomposable g.. (context) - Courcelle, Mosbah - 1993
1 Generalized model-checking problems for rst-order logic (context) - Grohe - 2000
1 in der Logik und ihre algorithmischen Anwendungen (context) - Woehrle, at - 2000
1 Checking rst-order properties of treedecomposable graphs (context) - Frick, Grohe - 1999
1 private communication (context) - Woehrle - 2000
1 Annals of Mathematics and Arti cial Intelligence (context) - Grandjean, linear et al. - 1996
1 Linear time algortihms and NP-complete problems (context) - Grandjean - 1994
Documents on the same site (http://logik.mathematik.uni-freiburg.de/preprints.html): More
On the (infinite) Model Theory of Fixed-Point Logics - Flum (1995) (Correct)
Enhancing Fixed Point Logic With Cardinality Quantifiers - Hella, Imhof (1996) (Correct)
Total and Partial Well-Founded Datalog Coincide - Flum, Kubierschky, Ludäscher (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC