Computers And Intractability A Guide To The Theory Of Np Completeness
Explore this paper's citation graph
- Published
- 2016-01-01
- Cited by
- 7,446
- References
- 0
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:124074750
References
No references recorded for this paper.
Cited by
- Cyber-Physical Multi-Core Optimization for Resource and Cache Effects (C2ORES)
- 50 Years of fuzzy: from discrete to continuous to – Where?
- On Minimum Representations of Matched Formulas
- A unified data representation theory for network visualization, ordering and coarse-graining
- Uncovering hidden disease patterns by simulating clinical diagnostic processes
- Stable Matching with Uncertain Linear Preferences
- Méthodes et outils pour la conception optimale des réseaux de distribution d'électricité dans les aéronefs. (Methods and tools for the optimal design of aircraft electrical power systems)
- Alternating Towers and Piecewise Testable Separators
- Algorithms - A Top-Down Approach
- Solution of P versus NP problem
- Methods for Inference in Graphical Models
- Modular Structures, Robustness and Protection of Complex Networks: Theory, Complexity and Algorithms
- Approaches to Finite Variable Dependence: Expressiveness and Computational Complexity ; Riippuvuus äärellisten muuttujajoukkojen logiikoissa
- Characterising fitness landscapes with fitness-probability cloud and its applications to algorithm configuration
- Mechanisms for scheduling games with selfish players
- Wireless Sensor Networks: Software Architecture
- Analysis and Development of Various Evolutionary Computations for Multi-Objective Optimization in Job Shop Problems
- Parameter ecology for Feedback Vertex Set
- Information and Hardness Quantification of Graphs: A Computational Study
- On the (r,s)-domination number of a graph
Related papers
No related papers recorded.