
本文探討了代數幾何中三個經典列舉問題的拓撲複雜度，並證明了任何求解這些問題的演算法都存在拓撲複雜度的下界。


coremsg

計算代數幾何中列舉問題的拓撲複雜度與-pu-n-分類空間


計算代數幾何中列舉問題的拓撲複雜度與 $PU_n$ 分類空間


title_rewrite


This research paper explores the inherent computational difficulty of classic enumerative geometry problems, specifically finding the 27 lines on cubic surfaces, 28 bitangent lines, and 24 inflection points on quartic curves, proving nontrivial lower bounds for their topological complexity.


topological-complexity-of-finding-lines-on-cubic-surfaces-bitangents-and-inflection-points-on-quartic-curves


Topological Complexity of Finding Lines on Cubic Surfaces, Bitangents and Inflection Points on Quartic Curves
