2446 search results - page 128 / 490 » Choiceless Polynomial Time |
90
Voted
NETWORKS
2010
14 years 11 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
92
Voted
ORL
2010
14 years 7 months ago
2010
We show a robot vacuum using a protocol that next cleans the "dirtiest" incident edge may take exponential time to clean a network. This disproves a conjecture of Messing...
100
Voted
TCS
2011
14 years 7 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
120
click to vote
MCU
2007
15 years 2 months ago
2007
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
128
Voted
ACMSE
2006
ACM
15 years 4 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...