1998 search results - page 152 / 400 » Complexity of the Cover Polynomial |
159
click to vote
SAC
1997
ACM
15 years 10 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
156
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
183
click to vote
JOIN
2007
15 years 6 months ago
2007
— One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formul...
155
click to vote
RSA
2008
15 years 6 months ago
2008
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
183
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...