Amanote Research
Register
Sign In
Improvements in Polynomial-Time Feasibility Testing for EDF
doi 10.1109/date.2008.4484817
Full Text
Open PDF
Abstract
Available in
full text
Date
March 1, 2008
Authors
Alejandro Masrur
Sebastian Drossler
Georg Farber
Publisher
IEEE
Related search
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Robustness Results for Hierarchical Diff-Edf Scheduling Upon Heterogeneous Real-Time Packet Networks
Journal of Computer Science
Computer Networks
Software
Artificial Intelligence
Communications
MGZ, Hoy EDF
Revista Chilena de Salud Pública
A Polynomial Time Algorithm for Fault Diagnosability
Polynomial-Time Approximation Schemes for Scheduling Problems With Time Lags
Journal of Scheduling
Management Science
Engineering
Operations Research
Artificial Intelligence
Software
Finding Hamiltonian Cycle in Polynomial Time
Information Technology Journal
Testing, Verification and Improvements of Timeliness in ROS Processes
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
More on Noncommutative Polynomial Identity Testing
Comparing Universal Covers in Polynomial Time
