2446 search results - page 129 / 490 » Choiceless Polynomial Time |
119
Voted
ESA
2006
Springer
15 years 4 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
IEICET
2008
15 years 24 days ago
2008
Abstract. In this paper we propose an algorithm of factoring any integer N which has k different prime factors with the same bit-length, when ( 1 k+2 + k(k-1) ) log N high-order bi...
103
click to vote
TCS
2010
14 years 7 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
128
Voted
ISAAC
2000
Springer
15 years 4 months ago
2000
Springer
It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...
89
Voted
CCCG
2006
15 years 2 months ago
2006
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...