Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Daniel Průša
LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP
Related publications
A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems
INFOR
Signal Processing
Computer Science Applications
Information Systems
Reoptimization of NP-Hard Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Analysis of LP Relaxations for Multiway and Multicut Problems
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Generating Highly Balanced Sudoku Problems as Hard Problems
Journal of Heuristics
Control
Information Systems
Management Science
Computer Networks
Communications
Optimization
Operations Research
Artificial Intelligence
Software
Exact Algorithms for NP-Hard Problems: A Survey
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Some Hard Families of Parameterized Counting Problems
ACM Transactions on Computation Theory
Computational Theory
Theoretical Computer Science
Mathematics
Automating Resolution Is NP-Hard
Manufacturing Production Line Modelling and Classification of Associated NP-Hard Problems
International Journal of Computer & Software Engineering
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
Journal of Computer and System Sciences
Computer Networks
Applied Mathematics
Communications
Computational Theory
Mathematics
Theoretical Computer Science
