3353 search results - page 289 / 671 » Laver and set theory |
206
click to vote
SETA
2010
Springer
15 years 5 months ago
2010
Springer
In this paper we start developing a detailed theory of nega– Hadamard transforms. Consequently, we derive several results on negabentness of concatenations, and partially-symmetr...
184
click to vote
LPNMR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
188
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
223
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
178
click to vote
HT
2009
ACM
15 years 10 months ago
2009
ACM
We introduce four measures for the change of coalitions in social networks. The first one measures the change of the agents in the network over time, The second one measures the ...