925 search results - page 114 / 185 » Connectivity on Complete Lattices |
170
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common messag...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common messa...
138
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
175
click to vote
ENTCS
2008
15 years 6 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...