scientific article; zbMATH DE number 6322905

zbMATH Open1292.57013MaRDI QIDQ5494787FDOQ5494787

Authors: Fedor Duzhin, Biaoshuai Tao 

Publication date: 30 July 2014

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

Recommendations

• On the complexity of computing with planar algebraic curves
• Computable invariants for curves and surfaces
• The Computational Complexity of the Resolution of Plane Curve Singularities
• On resolution complexity of plane curves
• A Polynomial Time Complexity Bound for Computations on Curves
• Sur la complexité du calcul des projections d'une courbe projective
• scientific article; zbMATH DE number 1929952
• Complexity of computation of embedded resolution of algebraic curves
• Complexity of plane and spherical curves
• Polynomial complexity algorithms for computational problems in the theory of algebraic curves

zbMATH Keywords

Arnold's plane curve invariants

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) General low-dimensional topology (57M99)

Cited In (3)

• Title not available (Why is that?)
• COMPUTING MINKOWSKI SUMS OF PLANE CURVES
• A Polynomial Time Complexity Bound for Computations on Curves

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 Q5494787)