9532 search results - page 319 / 1907 » Logic, Graphs, and Algorithms |
199
click to vote
MFCS
2001
Springer
15 years 11 months ago
2001
Springer
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview...
175
click to vote
FSTTCS
2004
Springer
16 years 2 days ago
2004
Springer
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
232
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
160
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
195
click to vote
WADS
2007
Springer
16 years 24 days ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...