Zhi-Long Chen
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Discrete Math×1Combinatorics×1Optimization and Control×1
Frequent co-authors
Research Timeline
2026
Symmetric Numerical Three-Dimensional Matching: Intractability and Inapproximability
This paper proves the strong NP-completeness and APX-completeness of the Symmetric Numerical Three-Dimensional Matching problem.
Highlighted terms show continued research focus across papers