9842 search results - page 194 / 1969 » Problem complexity |
STACS
2000
Springer
15 years 6 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
119
click to vote
PLANX
2008
15 years 3 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
129
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
112
click to vote
LPAR
2010
Springer
15 years 26 days ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
CAISE
2007
Springer
15 years 8 months ago
2007
Springer
Semantic matching1 is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) match...