29908 search results - page 280 / 5982 » On the complexity of communication complexity |
144
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
169
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
157
click to vote
ENTCS
2008
15 years 6 months ago
2008
The satisfiability problems for CTL and CTL are known to be EXPTIME-complete, resp. 2EXPTIMEcomplete (Fischer and Ladner (1979), Vardi and Stockmeyer (1985)). For fragments that u...
179
click to vote
DAM
2006
15 years 6 months ago
2006
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
176
click to vote
JAIR
2008
15 years 6 months ago
2008
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...