3571 search results - page 465 / 715 » Cohen and Set Theory |
194
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
168
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
es of circulant matrices. Our class is broader than just circulants, and we study patterned systems using abstract algebra, specifically the observation that a set of matrices with...
184
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we attempt to further demonstrate connections between information theory and control, in a networked setting. Specifically, we consider the communication problem of b...
169
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
183
click to vote
DCC
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper all cocyclic Hadamard matrices of order less than 40 are classified. That is, all such Hadamard matrices are explicitly constructed, up to Hadamard equivalence. Thi...