Pages that link to "Item:Q5900797"
From MaRDI portal
The following pages link to Fundamentals of Computation Theory (Q5900797):
Displayed 10 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- On the ordered list subgraph embedding problems (Q270006) (← links)
- Time series shapelets: a novel technique that allows accurate, interpretable and fast classification (Q408601) (← links)
- A three-string approach to the closest string problem (Q414864) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- A GRASP algorithm for the closest string problem using a probability-based heuristic (Q1761970) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems (Q5321718) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)