The following pages link to Martin Kuetz (Q1838657):
Displayed 31 items.
- Item:Q1838657 (redirect page) (← links)
- Item:Q655428 (redirect page) (← links)
- Faster algorithms for computing longest common increasing subsequences (Q655431) (← links)
- Conway's Angel in three dimensions (Q817819) (← links)
- Simultaneous matchings: Hardness and approximation (Q931730) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- A note on the mean convergence of Lagrange interpolation (Q1164218) (← links)
- Monotony in interpolatory quadratures (Q1170456) (← links)
- On the positivity of certain Cotes numbers (Q1838658) (← links)
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- The Complexity of Boolean Matrix Root Computation (Q3082929) (← links)
- On the Locality of Extracting a 2-Manifold in (Q3512465) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- (Q3576655) (← links)
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard (Q3595495) (← links)
- (Q3601548) (← links)
- (Q3601569) (← links)
- Asymptotic Error Bounds for a Class of Interpolatory Quadratures (Q3676610) (← links)
- (Q3679686) (← links)
- On the Asymptotic Behaviour of Some Cotes Numbers (Q3726707) (← links)
- (Q4736847) (← links)
- (Q4743229) (← links)
- Lower Bounds for Lucas Chains (Q4785626) (← links)
- ScrewBox: a Randomized Certifying Graph-<i>Non</i>-Isomorphism Algorithm (Q5233501) (← links)
- How much Geometry it takes to Reconstruct a 2-Manifold in ℝ<sup>3</sup> (Q5233510) (← links)
- Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517) (← links)
- How much geometry it takes to reconstruct a 2-manifold in R <sup>3</sup> (Q5406203) (← links)
- Computing and Combinatorics (Q5717016) (← links)
- Algorithms - ESA 2003 (Q5897282) (← links)
- Algorithms and Computation (Q5897844) (← links)
- Computing roots of directed graphs is graph isomorphism hard (Q6471969) (← links)