Unlike a contract (where the student solves a problem for your company), this type of opportunity assumes that the student’s problem is primarily being solved, i.e., learning something and meeting their obligations. The expectation is that this work will be submitted as a semestral work or final thesis. Therefore the assignment must be interesting from the university’s perspective and must (especially for final theses) meet certain rules. The details are dealt with when the thesis topic is approved by the faculty. It is preferable if the assignment contains some research questions, but it must not be the case.
Algorithms for NP-hard problems
For some NP-hard problems, there are practical algorithms that use “typical input properties”. Loosely speaking, an NP-hard problem is one for which we do not assume the existence of an effective algorithm (without any other limitations). For example, a common input may come from a specific chart class or be limited in some other way (for example, scales are only in a certain interval, etc.). NP-hard problems are plentiful; the thesis will deal with a specific variant of a pre-selected graph problem or problem from algorithmic game theory.
- Reward: 10 thous. CZK
- Delivery date: December 2025 (i.e. I am not in a hurry for this.)
As you can see from the example, the assignment can be quite general. It is specified in more detail when students apply. However, overly general assignments are not very attractive to students. For this type of assignment, we have to follow local legal requirements, according to which students’ school work is their intellectual property. Therefore, a specific licensing model needs to be established.