bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 5 years, 7 months |
seen | Mar 27 at 23:55 | |
stats | profile views | 170 |
Mar 15 |
awarded | Popular Question |
Jul 2 |
awarded | Curious |
Mar 7 |
awarded | Popular Question |
Oct 7 |
awarded | Caucus |
Aug 11 |
awarded | Yearling |
Aug 11 |
answered | LP constraint enconding |
Aug 11 |
awarded | Citizen Patrol |
Aug 11 |
answered | Is there a quick way to find all roots of a real polynomial with multiple variables? |
Jul 1 |
comment |
Math puzzles for dinner
Right, it is remarkably easier to think about a finite set of marbles. |
Jun 29 |
comment |
Math puzzles for dinner
@Hilbert: Well, the solution works even without perfect stirring. |
Jan 31 |
comment |
Class of integrable 0/1-functions “with no null sets.”
Nik: Right, the set of all Riemann integrable functions is too large for my purposes. |
Jan 30 |
asked | Class of integrable 0/1-functions “with no null sets.” |
Apr 21 |
accepted | Partially optimal solutions in integer linear programming |
Nov 22 |
answered | Partially optimal solutions in integer linear programming |
Nov 21 |
asked | Partially optimal solutions in integer linear programming |
Sep 21 |
asked | Number of breakpoints in parametric maximum flow problems |
Nov 11 |
awarded | Commentator |
Nov 11 |
comment |
Playing an (invertible) matrix game with two players
Are you sure that there is a winning strategy for A if $n$ is odd? w.l.o.g. A plays a 1 in position (1,1). If B then plays a 0 in (2,2) it looks as of B can either create a row/column of 0s or a 2x2 submatrix of 0s no matter what A plays. |
Oct 27 |
comment |
Math puzzles for dinner
You don't even have to stir perfectly |
Oct 21 |
answered | formulate edge length problem as convex optimization problem |