User Neal Young - Theoretical Computer Science Stack Exchange

Results from the 2022 Developer Survey are now available

Neal Young

Member for 10 years, 4 months
Last seen this week

cs.ucr.edu/~neal

6 Questions

Score Activity Newest Views

4 votes

0 answers

73 views

Complexity of detecting general position in the plane?

reference-request computational-geometry

asked Dec 8, 2021 at 18:18

1 vote

1 answer

78 views

partitioning points in the plane into two clusters to minimize maximum cluster diameter

cg.comp-geom clustering diameter

asked Sep 21, 2021 at 15:50

8 votes

1 answer

321 views

Can you find a counter-example for this proposed Graph Isomorphism algorithm?

graph-isomorphism puzzles

asked Sep 16, 2020 at 15:07

5 votes

0 answers

77 views

reference request: greedy algorithm for fractional interval covering

reference-request linear-programming greedy-algorithms

asked Aug 10, 2020 at 19:00

16 votes

0 answers

447 views

a geometric variant of k-medians. NP-hard or in P?

np-hardness polynomial-time set-cover clustering dynamic-programming

asked May 4, 2015 at 4:50

7 votes

0 answers

360 views

mixed vs behavior strategies for zero-sum game with infinite extensive form

reference-request gt.game-theory

asked Dec 23, 2012 at 21:51