Thore Husfeldt

Matematik

1. Counting 100%
2. Subgraph 71%
3. Graph Matching 50%
4. Inclusion-exclusion 50%
5. Tutte Polynomial 44%
6. Vertex of a graph 44%
7. Disjoint Paths 41%
8. Path 40%
9. Cubic Graph 39%
10. Exponential time 37%
11. Time Complexity 36%
12. Coding 34%
13. Maximum Degree 33%
14. Planar graph 31%
15. Presentation 29%
16. Modulo 28%
17. Graph in graph theory 22%
18. Count 22%
19. Randomized Algorithms 22%
20. Polynomial-time Algorithm 21%
21. Directed Graph 16%
22. Knowledge 15%
23. Path Length 14%
24. Placement 13%
25. Multigraph 13%
26. Generalise 13%
27. Deterministic Algorithm 13%
28. Perfect Matching 12%
29. Grassmann Algebra 12%
30. Fast Algorithm 11%
31. Lower bound 11%
32. Pathwidth 11%
33. Exterior Algebra 11%
34. Longest Path 11%
35. Polynomial time 11%
36. Undirected Graph 10%
37. Isomorphism Problem 10%
38. Assignment 10%
39. Multivariate Polynomials 9%
40. Disjoint 9%
41. Output 8%
42. Integer 7%
43. Multiplicative 7%
44. Parity 7%
45. Satisfiability 6%
46. Polynomial 6%
47. Arbitrary 6%
48. Determinant 5%
49. Generalization 5%
50. Independent Set 5%