Категория:ClassicHardProblems — различия между версиями
Материал из DISCOPAL
StasFomin (обсуждение | вклад) (Новая страница: «Классические труднорешаемые задачи.») |
StasFomin (обсуждение | вклад) |
||
| Строка 1: | Строка 1: | ||
| − | Классические труднорешаемые задачи. | + | Классические труднорешаемые (NPC, APXC) задачи. |
Текущая версия на 09:39, 5 апреля 2023
Классические труднорешаемые (NPC, APXC) задачи.
Страницы в категории «ClassicHardProblems»
Показано 200 страниц из 213, находящихся в данной категории.
(Предыдущая страница) (Следующая страница)A
H
- Hardprob/Longest Common Subsequence
- Hardprob/Longest Computation
- Hardprob/Longest Path
- Hardprob/Longest Path With Forbidden Pairs
- Hardprob/Maximum 3-Dimensional Matching
- Hardprob/Maximum Achromatic Number
- Hardprob/Maximum Balanced Connected Partition
- Hardprob/Maximum Bounded 0-1 Programming
- Hardprob/Maximum Capacity Representatives
- Hardprob/Maximum Class-Constrained Knapsack
- Hardprob/Maximum Clique
- Hardprob/Maximum Common Embedded Sub-Tree
- Hardprob/Maximum Common Induced Subgraph
- Hardprob/Maximum Common Point Set
- Hardprob/Maximum Common Subgraph
- Hardprob/Maximum Common Subtree
- Hardprob/Maximum Constrained Partition
- Hardprob/Maximum Constrained Sequencing To Minimize Tardy Task Weight
- Hardprob/Maximum Cut
- Hardprob/Maximum D-Vector Covering
- Hardprob/Maximum Degree Bounded Connected Subgraph
- Hardprob/Maximum Directed Cut
- Hardprob/Maximum Disjoint Connecting Paths
- Hardprob/Maximum Distinguished Ones
- Hardprob/Maximum Domatic Partition
- Hardprob/Maximum Edge Subgraph
- Hardprob/Maximum H-Matching
- Hardprob/Maximum Horn Core
- Hardprob/Maximum Hyperplane Consistency
- Hardprob/Maximum Independent Sequence
- Hardprob/Maximum Independent Set
- Hardprob/Maximum Induced Connected Subgraph With Property P
- Hardprob/Maximum Induced Subgraph With Property P
- Hardprob/Maximum Integer K-Choice Knapsack
- Hardprob/Maximum Integer M-Dimensional Knapsack
- Hardprob/Maximum Integral K-Multicommodity Flow On Trees
- Hardprob/Maximum K-Colorable Induced Subgraph
- Hardprob/Maximum K-Colorable Subgraph
- Hardprob/Maximum K-Constraint Satisfaction
- Hardprob/Maximum K-Cut
- Hardprob/Maximum K-Facility Dispersion
- Hardprob/Maximum K-Facility Location
- Hardprob/Maximum K-Satisfiability
- Hardprob/Maximum Knapsack
- Hardprob/Maximum Leaf Spanning Tree
- Hardprob/Maximum Minimum Metric K-Spanning Tree
- Hardprob/Maximum Minimum Spanning Tree Deleting K Edges
- Hardprob/Maximum Not-All-Equal 3-Satisfiability
- Hardprob/Maximum Number Of Satisfiable Formulas
- Hardprob/Maximum Packing Integer Programming
- Hardprob/Maximum Planar Subgraph
- Hardprob/Maximum Priority Flow
- Hardprob/Maximum Quadratic Assignment
- Hardprob/Maximum Quadratic Programming
- Hardprob/Maximum Renamable Horn Subformula
- Hardprob/Maximum Satisfiability
- Hardprob/Maximum Satisfiability Of Quadratic Equations Over GF(Q)
- Hardprob/Maximum Satisfiability Of Quadratic Equations Over Gf(Q)
- Hardprob/Maximum Satisfying Linear Subsystem
- Hardprob/Maximum Set Packing
- Hardprob/Maximum Set Splitting
- Hardprob/Maximum Subforest
- Hardprob/Maximum Triangle Packing
- Hardprob/Maximum Weighted Satisfiability With Bound
- Hardprob/Minimum 0-1 Programming
- Hardprob/Minimum 3-Dedicated Processor Scheduling
- Hardprob/Minimum 3-Dimensional Assignment
- Hardprob/Minimum 3-Dnf Satisfiability
- Hardprob/Minimum Array Partition
- Hardprob/Minimum B-Balanced Cut
- Hardprob/Minimum B-Vertex Separator
- Hardprob/Minimum Bandwidth
- Hardprob/Minimum Bend Number
- Hardprob/Minimum Biconnectivity Augmentation
- Hardprob/Minimum Bin Packing
- Hardprob/Minimum Block-Angular Convex Programming
- Hardprob/Minimum Bottleneck Path Matching
- Hardprob/Minimum Bounded Diameter Augmentation
- Hardprob/Minimum Broadcast Time
- Hardprob/Minimum Chinese Postman For Mixed Graphs
- Hardprob/Minimum Chordal Graph Completion
- Hardprob/Minimum Clique Cover
- Hardprob/Minimum Clique Partition
- Hardprob/Minimum Color Sum
- Hardprob/Minimum Communication Cost Spanning Tree
- Hardprob/Minimum Complete Bipartite Subgraph Cover
- Hardprob/Minimum Consistent Finite Automaton
- Hardprob/Minimum Covering Integer Programming
- Hardprob/Minimum Crossing Number
- Hardprob/Minimum Cut Cover
- Hardprob/Minimum Cut Linear Arrangement
- Hardprob/Minimum Degree Spanning Tree
- Hardprob/Minimum Diameter Spanning Subgraph
- Hardprob/Minimum Diameters Decomposition
- Hardprob/Minimum Directed Bandwidth
- Hardprob/Minimum Distinguished Ones
- Hardprob/Minimum Dominating Set
- Hardprob/Minimum Dynamic Storage Allocation
- Hardprob/Minimum Edge Coloring
- Hardprob/Minimum Edge Deletion K-Partition
- Hardprob/Minimum Edge Deletion To Obtain Subgraph With Property P
- Hardprob/Minimum Edge Dominating Set
- Hardprob/Minimum Edge K-Spanner
- Hardprob/Minimum Equivalence Deletion
- Hardprob/Minimum Equivalent Digraph
- Hardprob/Minimum Exact Cover
- Hardprob/Minimum Facility Location
- Hardprob/Minimum Feedback Arc Set
- Hardprob/Minimum Feedback Vertex Set
- Hardprob/Minimum File Transfer Scheduling
- Hardprob/Minimum Flow-Shop Scheduling
- Hardprob/Minimum General Routing
- Hardprob/Minimum Generalized 0-1 Assignment
- Hardprob/Minimum Generalized Steiner Network
- Hardprob/Minimum Geometric 3-Degree Spanning Tree
- Hardprob/Minimum Geometric Disk Cover
- Hardprob/Minimum Geometric Steiner Tree
- Hardprob/Minimum Geometric Traveling Salesperson
- Hardprob/Minimum Graph Coloring
- Hardprob/Minimum Graph Inference
- Hardprob/Minimum Graph Motion Planning
- Hardprob/Minimum Graph Transformation
- Hardprob/Minimum Height Two Dimensional Packing
- Hardprob/Minimum Hitting Set
- Hardprob/Minimum Independent Dominating Set
- Hardprob/Minimum Interval Graph Completion
- Hardprob/Minimum Job Shop Scheduling
- Hardprob/Minimum K-Capacitated Tree Partition
- Hardprob/Minimum K-Center
- Hardprob/Minimum K-Clustering
- Hardprob/Minimum K-Clustering Sum
- Hardprob/Minimum K-Cut
- Hardprob/Minimum K-Edge Connected Subgraph
- Hardprob/Minimum K-Median
- Hardprob/Minimum K-Satisfiability
- Hardprob/Minimum K-Spanning Tree
- Hardprob/Minimum K-Stacker Crane Problem
- Hardprob/Minimum K-Supplier
- Hardprob/Minimum K-Switching Network
- Hardprob/Minimum K-Vertex Connected Subgraph
- Hardprob/Minimum Length Equivalent Frege Proof
- Hardprob/Minimum Length Triangulation
- Hardprob/Minimum Linear Arrangement
- Hardprob/Minimum Local Register Allocation
- Hardprob/Minimum Locally Testable Automaton Order
- Hardprob/Minimum Maximal Matching
- Hardprob/Minimum Maximum Disjoint Connecting Paths
- Hardprob/Minimum Metric Bottleneck Wandering Salesperson Problem
- Hardprob/Minimum Metric Dimension
- Hardprob/Minimum Metric Traveling K-Salesperson Problem
- Hardprob/Minimum Metric Traveling Salesperson Problem
- Hardprob/Minimum Multi Cut
- Hardprob/Minimum Multiprocessor Scheduling
- Hardprob/Minimum Multiprocessor Scheduling With Speed Factors
- Hardprob/Minimum Multiway Cut
- Hardprob/Minimum Network Inhibition On Planar Graphs
- Hardprob/Minimum Number Of Satisfiable Formulas
- Hardprob/Minimum Open-Shop Scheduling
- Hardprob/Minimum Parallel Processor Total Flow Time
- Hardprob/Minimum Permutation Group Base
- Hardprob/Minimum Planar Record Packing
- Hardprob/Minimum Point-To-Point Connection
- Hardprob/Minimum Precedence Constrained Scheduling
- Hardprob/Minimum Precedence Constrained Sequencing With Delays
- Hardprob/Minimum Preemptive Scheduling With Set-Up Times
- Hardprob/Minimum Quadratic 0-1 Assignment
- Hardprob/Minimum Quotient Cut
- Hardprob/Minimum Ratio-Cut
- Hardprob/Minimum Rectangle Cover
- Hardprob/Minimum Rectangle Tiling
- Hardprob/Minimum Rectilinear Global Routing
- Hardprob/Minimum Register Sufficiency
- Hardprob/Minimum Relevant Variables In Linear System
- Hardprob/Minimum Resource Constrained Scheduling
- Hardprob/Minimum Routing Tree Congestion
- Hardprob/Minimum Schedule Length
- Hardprob/Minimum Separating Subdivision
- Hardprob/Minimum Sequencing With Release Times
- Hardprob/Minimum Set Cover
- Hardprob/Minimum Single Sink Edge Installation
- Hardprob/Minimum Stacker Crane Problem
- Hardprob/Minimum Steiner Tree
- Hardprob/Minimum Storage Time Sequencing
- Hardprob/Minimum Strong Connectivity Augmentation
- Hardprob/Minimum Sum Of Squares
- Hardprob/Minimum Test Collection
- Hardprob/Minimum Time-Cost Tradeoff
- Hardprob/Minimum Travel Robot Localization
- Hardprob/Minimum Traveling Repairman
- Hardprob/Minimum Traveling Salesperson
- Hardprob/Minimum Tree Compact Packing
- Hardprob/Minimum Tree Width
- Hardprob/Minimum Two-Processor Flow Shop Scheduling With Batch Set-Up Times
- Hardprob/Minimum Unsatisfying Linear Subsystem
- Hardprob/Minimum Unsplittable Flow
- Hardprob/Minimum Upgrading Spanning Tree
- Hardprob/Minimum Vehicle Scheduling On Tree
- Hardprob/Minimum Vertex Cover
- Hardprob/Minimum Vertex Deletion To Obtain Connected Subgraph With Property P