Pages without language links
Jump to navigation
Jump to search
The following pages do not link to other language versions.
Showing below up to 50 results in range #1,601 to #1,650.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Reduction from Maximum Inner Product Search to Boolean d-Attribute Stable Matching
- Reduction from Maximum Inner Product Search to Stable Matching Verification
- Reduction from Maximum Inner Product Search to Stable Pair Checking
- Reduction from Maximum Subarray to Distance Product
- Reduction from Maximum Subarray to Negative Triangle Detection
- Reduction from Metricity to Negative Triangle Detection
- Reduction from Min-Weight k-Clique to Minimum Weight k-Cycle
- Reduction from Min-Weight k-Cycle to Undirected Wiener Index
- Reduction from Minimum Triangle to Second Shortest Simple Path
- Reduction from Minimum Witness Finding to Negative Triangle Detection
- Reduction from Negative Triangle Detection to 2D Maximum Subarray
- Reduction from Negative Triangle Detection to All-Nodes Median Parity
- Reduction from Negative Triangle Detection to All-Nodes Positive Betweenness Centrality
- Reduction from Negative Triangle Detection to Betweenness Centrality (BC)
- Reduction from Negative Triangle Detection to Matrix Product Verification
- Reduction from Negative Triangle Detection to Maximum Subarray
- Reduction from Negative Triangle Detection to Median
- Reduction from Negative Triangle Detection to Metricity
- Reduction from Negative Triangle Detection to Radius
- Reduction from Negative Triangle Detection to Shortest Cycle
- Reduction from Negative Triangle Listing to Negative Triangle Detection
- Reduction from Negative Triangle Search to Negative Triangle Detection
- Reduction from Negative Triangle to Price Query
- Reduction from Nondecreasing Triangle to Triangle in Unweighted Graph
- Reduction from OV to Bichromatic Hamming Close Pair
- Reduction from OV to Diameter 2 vs 3
- Reduction from OV to Disjunctive Queries of Reachability in MDPs
- Reduction from OV to Disjunctive Queries of Safety in Graphs
- Reduction from OV to Disjunctive Reachability Queries in MDPs
- Reduction from OV to Edit Distance
- Reduction from OV to Generalized Büchi Games
- Reduction from OV to Largest Common Subtree
- Reduction from OV to Partial Match
- Reduction from OV to Subtree Isomorphism
- Reduction from OV to k-OV
- Reduction from OuMV to dynamic st-Maximum Flow
- Reduction from OuMv to Bipartite Graph MCM
- Reduction from Partial Match to OV
- Reduction from Point on 3 Lines to 3 Points on Line
- Reduction from Positive Betweenness Centrality to Diameter
- Reduction from Reach Centrality to Diameter
- Reduction from Reach Centrality to Positive Betweenness Centrality
- Reduction from Replacement Paths Problem (RPP) to 1-sensitive decremental st-shortest paths
- Reduction from Strips Cover Box to Point Covering
- Reduction from Strips Cover Box to Triangles Cover Triangle
- Reduction from Triangle Collection* to dynamic 4/3-Diameter
- Reduction from Triangle Detection to Disjunctive Queries of Reachability in MDPs
- Reduction from Triangle Detection to Disjunctive Queries of Safety in Graphs
- Reduction from Triangle Detection to Disjunctive Reachability Queries in MDPs
- Reduction from Triangle Detection to Disjunctive coBüchi Objectives