446 search results - page 52 / 90 » A Combinatorial Theorem for Trees |
133
click to vote
MLQ
2007
15 years 5 months ago
2007
Local sentences were introduced by Ressayre in [Res88] who proved certain remarkable stretching theorems establishing the equivalence between the existence of finite models for t...
179
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
139
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...
173
click to vote
TCS
2010
15 years 21 days ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
161
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...