1379 search results - page 77 / 276 » The Complexity of the Annihilating Polynomial |
102
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
114
Voted
PODC
2010
ACM
15 years 4 months ago
2010
ACM
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
105
click to vote
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
105
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
PLANX
2008
15 years 2 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...