per the well known results of Wild et. al, polyamorous scheduling has been shown to be NP-hard, combinatorially challenging. this is only true however for random polycules. for polycules subject to…

Posters: DanielleFong. DanielleFong

2 likes recorded by the source corpus.