Pages without language links

Showing below up to 50 results in range #1 to #50.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

1. $(\min, \leq)$ Product
2. $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
3. $O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
4. $O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
5. $\delta$-Triangle Conjecture
6. (3-Dimensional, i.e. project onto a 2D plane)
7. (5/3)-approximate ap-shortest paths
8. (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
9. ( Negative Triangle)
10. (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull)
11. 0-1 Linear Programming
12. 1-in-3SAT
13. 1-sensitive (3/2)-approximate ss-shortest paths
14. 1-sensitive (4/3)-approximate decremental diameter
15. 1-sensitive (4/3)-approximate decremental eccentricity
16. 1-sensitive decremental diameter
17. 1-sensitive decremental st-shortest paths
18. 1-sensitive incremental ss-reach
19. 1D Maximum Subarray
20. 2-Dimensional Poisson Problem
21. 2-Graph Coloring
22. 2-Player
23. 2-dimensional Convex Hull
24. 2-dimensional Convex Hull, Dynamic
25. 2-dimensional Convex Hull, Online
26. 2-dimensional array representation
27. 2-dimensional space, $l m$ (or $l \infty$) norm
28. 2-dimensional space, Euclidean metric
29. 2-sensitive (7/5)-approximate st-shortest paths
30. 2-sensitive decremental st-shortest paths
31. 2-sensitive incremental st-reach
32. 2D Maximum Subarray
33. 2SAT
34. 2 Strong Components (dynamic)
35. 3-Dimensional Poisson Problem
36. 3-Graph Coloring
37. 3-OV
38. 3-dimensional Convex Hull
39. 3D Motion Planning
40. 3SAT
41. 3SAT-5
42. 3SUM
43. 3SUM'
44. 3SUM Hypothesis (3-SUM Hypothesis)
45. 3 - Graph Coloring
46. 3 Points on Line
47. 4-Graph Coloring
48. 4NF Decomposition
49. 4NF Decomposition for Conflict-Free Dependency Sets
50. 4NF Decomposition for Functional and Multivalued Dependency Sets

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)