Pages that link to "Item:Q4857588"
From MaRDI portal
The following pages link to Computational Complexity of Two-Dimensional Regions (Q4857588):
Displayed 18 items.
- On parallel complexity of analytic functions (Q388112) (← links)
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- The computational complexity of distance functions of two-dimensional domains (Q557838) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Jordan curves with polynomial inverse moduli of continuity (Q995570) (← links)
- Computable invariance (Q1274805) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- On the computability of fractal dimensions and Hausdorff measure (Q1295381) (← links)
- A theory of complexity for continuous time systems (Q1599194) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- Who Asked Us? How the Theory of Computing Answers Questions about Analysis (Q3297823) (← links)
- Jordan Areas and Grids (Q4918015) (← links)
- Complexity of Operators on Compact Sets (Q4918033) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)