1 programming-"the"-"DAAD"-"UCL"-"U"-"SciLifeLab"-"IMPRS-ML" "P" Postdoctoral positions at Durham University
Sort by
Refine Your Search
-
state that any computationally hard graph problem satisfying some condition C can still be solved efficiently on a graph class if, and only if, the class has property P. The project is funded by
Enter an email to receive alerts for programming-"the"-"DAAD"-"UCL"-"U"-"SciLifeLab"-"IMPRS-ML" "P" positions