446 search results - page 34 / 90 » A Combinatorial Theorem for Trees |
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
136
click to vote
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
108
click to vote
AISC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
107
click to vote
IJIS
2011
14 years 3 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
188
click to vote
ML
2011
ACM
14 years 6 months ago
2011
ACM
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...