2446 search results - page 284 / 490 » Choiceless Polynomial Time |
140
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
176
Voted
LICS
2000
IEEE
15 years 8 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
136
Voted
RTSS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
137
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
The syntenic dista nce between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic dis...
134
Voted
PODS
1999
ACM
15 years 8 months ago
1999
ACM
Despite advances in recent years in the area of mandatory access control in database systems, today's information repositories remain vulnerable to inference and data associa...