696 search results - page 35 / 140 » A class of combinatorial identities |
108
click to vote
FSE
2003
Springer
15 years 7 months ago
2003
Springer
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
119
click to vote
COLT
1991
Springer
15 years 5 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
121
click to vote
IANDC
2010
14 years 11 months ago
2010
There is an increasing interest in the shuffle product on formal languages, mainly because it is a standard tool for modeling process algebras. It still remains a mysterious opera...
113
click to vote
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...
108
click to vote
IDEAS
2005
IEEE
15 years 7 months ago
2005
IEEE
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...