2446 search results - page 245 / 490 » Choiceless Polynomial Time |
145
click to vote
ESA
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
176
click to vote
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
123
Voted
IPL
2002
15 years 3 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
173
click to vote
MLDM
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
112
click to vote
DM
2008
15 years 4 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...