Some intractable problems in digital signal processing
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Arithmetic Complexity of ComputationsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1980
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum LatenessMathematics of Operations Research, 1977
- Code Generation for Expressions with Common SubexpressionsJournal of the ACM, 1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Complete Register Allocation ProblemsSIAM Journal on Computing, 1975
- NP-complete scheduling problemsJournal of Computer and System Sciences, 1975
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975