1998 search results - page 106 / 400 » Complexity of the Cover Polynomial |
180
click to vote
LATA
2009
Springer
16 years 13 days ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
128
click to vote
LICS
2002
IEEE
15 years 10 months ago
2002
IEEE
We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC ¢ , the dynamic classes corresponding to relational calculus and (...
145
click to vote
COCO
2009
Springer
15 years 9 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...
175
click to vote
PODC
2010
ACM
15 years 9 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....
163
click to vote
LATIN
2010
Springer
15 years 9 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...