1 computational-complexity Postdoctoral positions at Eindhoven University of Technology (TU/e); 27 Sep ’25 published
Sort by
Refine Your Search
-
translating natural language specification into a symbolic representation (e.g. knowledge graph (KG) or logic program) and a symbolic solver computing the solution. Another example is the generation
Searches related to computational complexity
Enter an email to receive alerts for computational-complexity positions