Theses on a related topic (having the same keywords):
infeasibility analysis, unsatisfiability analysis, mus enumeration, minimal unsatisfiable subsetsKeywords ordered alphabetically | Keywords ordered by occurrence rate
1.
Bendík, Jaroslav
Faculty: Faculty of Informatics
Year: 2016, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Parallel and Distributed Systems
Master's thesis defence: Algoritmy pro hledání maximální splnitelné množiny omezení | Theses on a related topic![Display description Display description](/pics/design/14/z/ico/navodek-plus.png)
Faculty: Faculty of Informatics
Year: 2016, studies completed, degree conferred: Mgr.
Programme/field: Informatics / Parallel and Distributed Systems
Master's thesis defence: Algoritmy pro hledání maximální splnitelné množiny omezení | Theses on a related topic
![Display description Display description](/pics/design/14/z/ico/navodek-plus.png)
2.
Bendík, Jaroslav
Faculty: Faculty of Informatics
Year: 2021, studies completed, degree conferred: Ph.D.
Programme/field: Computer Science / Computing Technology and Methodology
Doctoral thesis defence: Minimal sets over a monotone predicate: Enumeration and counting | Theses on a related topic
Faculty: Faculty of Informatics
Year: 2021, studies completed, degree conferred: Ph.D.
Programme/field: Computer Science / Computing Technology and Methodology
Doctoral thesis defence: Minimal sets over a monotone predicate: Enumeration and counting | Theses on a related topic