254 search results - page 12 / 51 » Deterministic Soliton Graphs |
FSTTCS
2008
Springer
15 years 26 days ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
SIAMDM
2008
14 years 11 months ago
2008
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking a...
JACM
2000
14 years 11 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
102
click to vote
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
118
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...