4488 search results - page 355 / 898 » Properties of NP-Complete Sets |
176
click to vote
TAMC
2007
Springer
16 years 1 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
195
click to vote
DFT
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a procedure for Synthesis of LINear test pattern Generators called SLING. SLING can synthesize linear test pattern generators that satisfy constraints on area,...
207
click to vote
DASFAA
2005
IEEE
16 years 1 months ago
2005
IEEE
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
225
click to vote
ESA
2005
Springer
16 years 1 months ago
2005
Springer
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
172
click to vote
ESORICS
2005
Springer
16 years 1 months ago
2005
Springer
Information flow and non-interference are well-established techniques for expressing both integrity and privacy properties. Because of the enormous potential to transmit informati...