Short pages

Jump to navigation Jump to search

Showing below up to 50 results in range #1,451 to #1,500.

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

  1. (hist) ‎Steal/No-Force ‎[554 bytes]
  2. (hist) ‎Reduction from Directed, Weighted APSP to 2-sensitive decremental st-shortest paths ‎[554 bytes]
  3. (hist) ‎Reduction from BMM to 1-sensitive (4/3)-approximate decremental diameter ‎[555 bytes]
  4. (hist) ‎Reduction from Diameter to Approximate Betweenness Centrality ‎[556 bytes]
  5. (hist) ‎Reduction from Approximate Betweenness Centrality to Diameter ‎[556 bytes]
  6. (hist) ‎Spielman, Teng (Inexact Laplacian Solver SDD Systems Solvers) ‎[556 bytes]
  7. (hist) ‎Maximum Strongly Connected Component ‎[557 bytes]
  8. (hist) ‎Reduction from OV to Subtree Isomorphism ‎[557 bytes]
  9. (hist) ‎Family:Vertex Centrality ‎[560 bytes]
  10. (hist) ‎Reduction from Replacement Paths Problem (RPP) to 1-sensitive decremental st-shortest paths ‎[560 bytes]
  11. (hist) ‎Reduction from OV to Largest Common Subtree ‎[563 bytes]
  12. (hist) ‎Reduction from OV to Disjunctive Queries of Reachability in MDPs ‎[563 bytes]
  13. (hist) ‎Reduction from OV to Disjunctive Reachability Queries in MDPs ‎[563 bytes]
  14. (hist) ‎Reduction from CNF-SAT to Longest Common Substring with don't cares ‎[566 bytes]
  15. (hist) ‎Weighted Interval Schedule Maximization Problem (ISMP) ‎[567 bytes]
  16. (hist) ‎More Believable Exponential Time Hypothesis (MBETH) ‎[567 bytes]
  17. (hist) ‎Reduction from Negative Triangle Detection to 2D Maximum Subarray ‎[569 bytes]
  18. (hist) ‎Parsing ‎[570 bytes]
  19. (hist) ‎Translating abstract syntax trees ‎[572 bytes]
  20. (hist) ‎Reduction from Weighted, Undirected APSP to 2D Maximum Subarray ‎[572 bytes]
  21. (hist) ‎HJLS algorithm ( Integer Relation) ‎[574 bytes]
  22. (hist) ‎Reduction from CNF-SAT to Local Alignment ‎[576 bytes]
  23. (hist) ‎Family:Boolean Satisfiability ‎[577 bytes]
  24. (hist) ‎Maximum cut ‎[578 bytes]
  25. (hist) ‎2-Graph Coloring ‎[578 bytes]
  26. (hist) ‎Reduction from Negative Triangle Listing to Negative Triangle Detection ‎[578 bytes]
  27. (hist) ‎Exponential Time Hypothesis (ETH) ‎[579 bytes]
  28. (hist) ‎Line drawing ‎[580 bytes]
  29. (hist) ‎Edmonds-Karp (bipartite (i.e. assignment), general Maximum-weight matching) ‎[581 bytes]
  30. (hist) ‎Reduction from Directed, Weighted APSP to All-Nodes Median Parity ‎[585 bytes]
  31. (hist) ‎Reduction from Maximum Inner Product Search to Stable Matching Verification ‎[585 bytes]
  32. (hist) ‎Vornoi Diagrams ‎[586 bytes]
  33. (hist) ‎Reduction from CNF-SAT to sensitive incremental ‎[586 bytes]
  34. (hist) ‎Reduction from Undirected, Weighted APSP to All-Nodes Median Parity ‎[587 bytes]
  35. (hist) ‎Integer relation ‎[588 bytes]
  36. (hist) ‎Polygon clipping ‎[588 bytes]
  37. (hist) ‎Min-Weight k-Clique Hypothesis ‎[588 bytes]
  38. (hist) ‎Reduction from Betweenness Centrality (BC) to Diameter ‎[588 bytes]
  39. (hist) ‎4NF decomposition ‎[590 bytes]
  40. (hist) ‎Entity resolution ‎[590 bytes]
  41. (hist) ‎Lossy compression ‎[590 bytes]
  42. (hist) ‎Unbalanced Orthogonal Vectors Hypothesis (UOVH) ‎[590 bytes]
  43. (hist) ‎Reduction from CNF-SAT to sensitive incremental ST-Reach ‎[590 bytes]
  44. (hist) ‎Reduction from k-Clique to RNA Folding ‎[590 bytes]
  45. (hist) ‎Reduction from OV to Disjunctive Queries of Safety in Graphs ‎[590 bytes]
  46. (hist) ‎Lossless Compression ‎[591 bytes]
  47. (hist) ‎Reduction from Maximum Inner Product Search to Boolean d-Attribute Stable Matching ‎[591 bytes]
  48. (hist) ‎Register Allocation ‎[594 bytes]
  49. (hist) ‎Rod-cutting problem ‎[594 bytes]
  50. (hist) ‎Orthogonal Vectors Hypothesis (OVH) ‎[594 bytes]

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Special:ShortPages"