1243 search results - page 90 / 249 » Complexity reduction of C-Algorithm |
ERSHOV
2003
Springer
15 years 6 months ago
2003
Springer
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
112
click to vote
CDC
2009
IEEE
15 years 6 months ago
2009
IEEE
— We present a method for complexity reduction in reachability analysis and controller synthesis via a Schur-based decomposition for LTI systems. The decomposition yields either ...
112
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
DATE
2010
IEEE
15 years 5 months ago
2010
IEEE
We have proposed (, )-based flow regulation to reduce delay and backlog bounds in SoC architectures, where bounds the traffic burstiness and the traffic rate. The regulation is co...
100
click to vote
STACS
2000
Springer
15 years 5 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...