Sciweavers

7 search results - page 2 / 2
» Database Theory, Yuri, and Me
Sort
View
BIRTHDAY
2010
Springer
13 years 8 months ago
Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
Martin Grohe
WWW
2008
ACM
14 years 8 months ago
A differential notion of place for local search
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...
Vlad Tanasescu, John Domingue