16666 search results - page 5 / 3334 » Descriptive and Computational Complexity |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
IAT
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
CBMS
2002
IEEE
14 years 10 days ago
2002
IEEE
The article deals with the problem of texture description. It presents a statistical approach. Specifically it introduces the use of first- and second-order statistics on textur...
TIME
2008
IEEE
14 years 1 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
STACS
2010
Springer
13 years 11 months ago
2010
Springer
We completely characterise the computational complexity of the list homomorphism problem for graphs in combinatorial and algebraic terms: for every graph H the problem is either N...