Pages that link to "Item:Q5311124"

The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311124):

Displaying 22 items.

• Fundamentals of parameterized complexity (Q383833) (← links)
• Structure of polynomial-time approximation (Q692893) (← links)
• Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
• Polynomial-average-time satisfiability problems (Q1095678) (← links)
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
• Master-slave strategy and polynomial approximation (Q1588828) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• Probabilistic parameterized polynomial time (Q2206227) (← links)
• Tight worst-case bounds for polynomial loop programs (Q2289065) (← links)
• Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• The complexity of polynomial-time approximation (Q2464331) (← links)
• On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
• Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
• On Parameterized Approximability (Q3499729) (← links)
• Parameterized Approximation Problems (Q3499730) (← links)
• Polynomial-time computable approximation of families of semialgebraic sets and combinatorial complexity (Q4005386) (← links)
• (Q4258576) (← links)
• (Q4517359) (← links)
• (Q4537179) (← links)
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
• (Q5702337) (← links)