scientific article

zbMATH Open1391.05048arXiv0710.1459MaRDI QIDQ3176596FDOQ3176596

Authors: Matjaž Konvalinka, Igor Pak 

Publication date: 23 July 2018

Full work available at URL: https://arxiv.org/abs/0710.1459

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

partitionscomplexityO'Hara's algorithm

Mathematics Subject Classification ID

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

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)