Uncategorized pages

Jump to navigation Jump to search

Showing below up to 50 results in range #1,551 to #1,600.

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

  1. Reduction from CNF-SAT to Dynamic MaxSCC
  2. Reduction from CNF-SAT to Dynamic ST-Reach
  3. Reduction from CNF-SAT to Frechet Distance
  4. Reduction from CNF-SAT to Local Alignment
  5. Reduction from CNF-SAT to Longest Common Substring with don't cares
  6. Reduction from CNF-SAT to Multiple Local Alignment
  7. Reduction from CNF-SAT to Positive Betweenness Centrality
  8. Reduction from CNF-SAT to SC2
  9. Reduction from CNF-SAT to constant sensitivity (4/3)-approximate incremental diameter
  10. Reduction from CNF-SAT to dynamic st-Maximum Flow
  11. Reduction from CNF-SAT to k-OV
  12. Reduction from CNF-SAT to sensitive incremental
  13. Reduction from CNF-SAT to sensitive incremental ST-Reach
  14. Reduction from Diameter to Approximate Betweenness Centrality
  15. Reduction from Diameter to Positive Betweenness Centrality
  16. Reduction from Diameter to Reach Centrality
  17. Reduction from Directed, Weighted APSP to 1-sensitive decremental diameter
  18. Reduction from Directed, Weighted APSP to 2-sensitive decremental st-shortest paths
  19. Reduction from Directed, Weighted APSP to All-Nodes Median Parity
  20. Reduction from Directed, Weighted APSP to Directed All-Nodes Positive Betweenness Centrality
  21. Reduction from Directed, Weighted APSP to Directed All-Nodes Reach Centrality
  22. Reduction from Directed, Weighted APSP to Dynamic $st$-Shortest Path
  23. Reduction from Directed, Weighted APSP to Dynamic Bipartite Maximum-Weight Matching
  24. Reduction from Directed, Weighted APSP to Negative Triangle Detection
  25. Reduction from Directed, Weighted APSP to Replacement Paths Problem (RPP)
  26. Reduction from Directed, Weighted APSP to Second Shortest Simple Path
  27. Reduction from Directed, Weighted APSP to Undirected, Weighted APSP
  28. Reduction from Directed Median to Directed, Weighted APSP
  29. Reduction from Directed Radius to Directed, Weighted APSP
  30. Reduction from Distance Product to Second Shortest Simple Path
  31. Reduction from GeomBase to 3SUM'
  32. Reduction from GeomBase to Planar Motion Planning
  33. Reduction from GeomBase to Separator1
  34. Reduction from GeomBase to Separator2
  35. Reduction from GeomBase to Strips Cover Box
  36. Reduction from GeomBase to Visibility Between Segments
  37. Reduction from GeomBase to Visibility From Infinity
  38. Reduction from Hole in Union to Triangles Cover Triangle
  39. Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow
  40. Reduction from MAX-CNF-SAT to Maximum Local Edge Connectivity
  41. Reduction from MAX-CNF-SAT to st-Maximum Flow
  42. Reduction from Matrix Product to Negative Triangle Detection
  43. Reduction from Max-Weight K-Clique to Maximum Square Subarray
  44. Reduction from Max-Weight K-Clique to Weighted Depth
  45. Reduction from Max-Weight k-Clique to Max-Weight Rectangle
  46. Reduction from Max-Weight k-Clique to Maximum Subarray
  47. Reduction from Maximum Inner Product Search to Boolean d-Attribute Stable Matching
  48. Reduction from Maximum Inner Product Search to Stable Matching Verification
  49. Reduction from Maximum Inner Product Search to Stable Pair Checking
  50. Reduction from Maximum Subarray to Distance Product

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