14054 search results - page 218 / 2811 » P |
128
click to vote
IJFCS
2008
15 years 4 months ago
2008
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In ...
103
click to vote
IPL
2006
15 years 4 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
126
Voted
FUIN
2002
15 years 4 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
140
click to vote
SETA
2010
Springer
15 years 3 months ago
2010
Springer
A sequence a = (a0, a1, a2, · · · , an) is said to be an almost p-ary sequence of period n + 1 if a0 = 0 and ai = ζbi p for 1 ≤ i ≤ n, where ζp is a primitive p-th root of...
176
click to vote
ALGORITHMICA
2010
15 years 3 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...