Pages that link to "Item:Q1286472"

The following pages link to On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472):

Displayed 3 items.

• Guarding galleries and terrains (Q845875) ‎ (← links)
• Fitting a \(C^m\)-smooth function to data. II (Q1017345) ‎ (← links)
• Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) ‎ (← links)