The following pages link to David W. Juedes (Q673643):
Displaying 26 items.
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← links)
- (Q853637) (redirect page) (← links)
- Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions (Q853643) (← links)
- Computational depth and reducibility (Q1334655) (← links)
- (Q1853545) (redirect page) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Completeness and weak completeness under polynomial-size circuits (Q1917077) (← links)
- Weakly complete problems are not rare (Q1918951) (← links)
- Modeling time-bounded prefix Kolmogorov complexity (Q1974444) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- Tight lower bounds for certain parameterized NP-hard problems (Q2568440) (← links)
- Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
- (Q3125562) (← links)
- Baire category and nowhere differentiability for feasible real functions (Q3159431) (← links)
- COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE (Q3839875) (← links)
- (Q4028413) (← links)
- Algorithm 755: ADOL-C (Q4371091) (← links)
- (Q4474091) (← links)
- (Q4535023) (← links)
- Completeness and weak completeness under polynomial-size circuits (Q4596607) (← links)
- Computational depth and reducibility (Q4630267) (← links)
- The Complexity and Distribution of Hard Problems (Q4834381) (← links)
- A generic framework for approximation analysis of greedy algorithms for star bicoloring (Q5085266) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311123) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710807) (← links)
