49 search results - page 1 / 10 » More on block intersection polynomials and new applications ... |
JCT
2010
13 years 3 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
CANS
2011
Springer
12 years 4 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
By comparing genomes among both closely and distally related species, comparative genomics analysis characterizes structures and functions of different genomes in both conserved a...
ISSS
1999
IEEE
13 years 9 months ago
1999
IEEE
In order to cope with the ever increasing complexity of todays application specific integrated circuits, a building block based design methodology is established. The system is co...
DM
2006
13 years 4 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...