scientific article; zbMATH DE number 6909291

MaRDI QIDQ3176596zbMATH OpenFDO

Authors Matjaž Konvalinka, Igor Pak

Publication date 23 July 2018

Full work available at URL https://arxiv.org/abs/0710.1459, http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0145

zbMATH Keywords

complexityO'Hara's algorithmpartitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Geometry and complexity of O'Hara's algorithm
• On a class of O(n^2) problems in computational geometry
• On a class of \(O(n^ 2)\) problems in computational geometry
• Combinatorial complexity in o-minimal geometry
• A geometric approach to complexity
• scientific article; zbMATH DE number 4032498
• scientific article; zbMATH DE number 1006218

Cited in

(2)

• Geometry and complexity of O'Hara's algorithm
• The Geometry of Algorithms with Orthogonality Constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176596)