10997 search results - page 104 / 2200 » On the Structure of Complete Sets |
150
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
158
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
161
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
141
click to vote
GPEM
2007
15 years 6 months ago
2007
The genetic programming bibliography aims to be the most complete reference of papers on genetic programming. In addition to locating publications, it contains coauthor and coedit...
168
click to vote
DAC
1999
ACM
16 years 7 months ago
1999
ACM
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...