Zobrazeno 1 - 2
of 2
pro vyhledávání: '"M. J. Coster"'
Autor:
Willem H. Haemers, M. J. Coster
Publikováno v:
Tilburg University-PURE
LetTm be the adjacency matrix of the triangular graph. We will give conditions for a linear combination ofTm, I andJ to be decomposable. This leads to Bruck-Ryser-Chowla like conditions for, what we call, triangular designs. These are quasi-symmetric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7efe3744c9ecda391a456f0ebf31562b
https://doi.org/10.1007/bf01388502
https://doi.org/10.1007/bf01388502
Publikováno v:
Advances in Cryptology — EUROCRYPT ’91 ISBN: 9783540546207
EUROCRYPT
EUROCRYPT
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9f4c14c12403f1a1d6b59055b6cb1b3
https://doi.org/10.1007/3-540-46416-6_4
https://doi.org/10.1007/3-540-46416-6_4
