Pages that link to "Item:Q5167553"
From MaRDI portal
The following pages link to Faster Algorithms via Approximation Theory (Q5167553):
Displaying 15 items.
- Faster algorithms for computing Hong's bound on absolute positiveness (Q972846) (← links)
- An optimal speedup algorithm for the measure problem (Q1262771) (← links)
- A tighter bound for FFd algorithm (Q1594856) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Dynamic study of Schröder's families of first and second kind (Q1652796) (← links)
- The approximating capability of fast forms (Q1971592) (← links)
- Fast approximate PCPs (Q2819532) (← links)
- Fast envelope algorithms (Q4571204) (← links)
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision (Q4602374) (← links)
- Efficient quantum algorithms for state measurement and linear algebra applications (Q4620263) (← links)
- (Q4708562) (← links)
- Graph Powering and Spectral Robustness (Q5027021) (← links)
- (Q5482653) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)
- Faster exact algorithms for hard problems: A parameterized point of view (Q5931443) (← links)