900 search results - page 15 / 180 » On Polynomial Time Computation over Unordered Structures |
125
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
109
click to vote
CPM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
124
click to vote
FOCS
2003
IEEE
15 years 7 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
129
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
116
Voted
TC
2008
15 years 1 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...