2446 search results - page 44 / 490 » Choiceless Polynomial Time |
ISVLSI
2002
IEEE
14 years 16 days ago
2002
IEEE
Retiming has been shown to be a powerful technique for improving the performance of synchronous circuits. However, even though retiming algorithms of polynomial time complexity ha...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
SWAT
2004
Springer
14 years 29 days ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...