787 search results - page 57 / 158 » Polynomial Constants are Decidable |
103
click to vote
DM
2008
15 years 3 months ago
2008
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
127
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
152
click to vote
FCT
2007
Springer
15 years 5 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
136
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present a non-malleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a manin-the-middle adversa...
150
Voted
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...