4378 search results - page 79 / 876 » On the Complexity of Ordered Colourings |
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
By using Semi-Definite Programming (SDP) as a tool, a new deign for Two-Dimensional (2-D) Diamond-Shaped (DS) filters is developed. Surprisingly, the diamond shape of the filter is...
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
IM
2007
13 years 8 months ago
2007
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
CIE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, w...
STACS
2001
Springer
14 years 1 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...