New answers tagged computational-geometry
1
vote
Good examples of "two is easy, three is hard" in computational sciences
MaxEnt distribution subject to equality constraints on cumulants is easy to compute for constraints on first 2 cumulants (closed form solution), hard for constraints on first 3 cumulants. In the ...
- 1,159
1
vote
Good examples of "two is easy, three is hard" in computational sciences
The non-negative rank of an entrywise non-negative matrix $A\in\mathbb{R}^{m\times n}_{\geq 0}$, i.e., the minimum $r$ for which a factorization $A = BC$ exists with $B\in\mathbb{R}^{m\times r}_{\geq ...
- 8,785
2
votes
Good examples of "two is easy, three is hard" in computational sciences
Given an integer N, it's easy enough to find m,n so that mn=N and ...
- 935
0
votes
Good examples of "two is easy, three is hard" in computational sciences
Predicting the behaviour of a pendulum is comparatively easy. For the simplification of a mathematical pendulum we know the analytic solutions and the numerical simulation of a single pendulum is ...
- 1,976
Top 50 recent answers are included