Search results
From MaRDI portal
- partition conjecture using the atom problem in discrete tomography 2014-03-27 Paper Tile-packing tomography is \(\mathbb{NP}\)-hard 2012-11-21 Paper Reconstructing...10 bytes (16 words) - 14:47, 12 December 2023
- Turing machines 2004-08-10 Paper Probabilistic solutions to some NP-hard matrix problems 2004-03-04 Paper https://portal.mardi4nfdi.de/entity/Q4449216 2004-02-08...10 bytes (19 words) - 16:43, 6 December 2023
- Paper Reductions between disjoint NP-pairs 2005-09-02 Paper Disjoint NP-Pairs 2005-02-21 Paper Bi-immunity separates strong NP-completeness notions 2004-11-23...10 bytes (19 words) - 15:16, 6 December 2023
- sizing problems with inventory bounds 2015-08-21 Paper The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial...10 bytes (16 words) - 02:33, 12 December 2023
- scheduling problem 2019-01-18 Paper Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem 2018-09-13 Paper...10 bytes (18 words) - 02:40, 11 December 2023
- for the travelling salesman problem and for the quadratic assignment problem. 2000-01-01 Paper The travelling salesman problem on permuted Monge matrices...10 bytes (18 words) - 06:30, 9 December 2023
- Paper Approximate belief updating in max-2-connected Bayes networks is NP-hard 2009-09-14 Paper https://portal.mardi4nfdi.de/entity/Q3624003 2009-04-28...10 bytes (18 words) - 18:16, 11 December 2023
- scheduling problem 2019-01-18 Paper Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem 2018-09-13 Paper...10 bytes (18 words) - 02:40, 11 December 2023
- single-machine total tardiness problem is NP-hard 2013-04-12 Paper Transformation of the network graph of scheduling problems with precedence constraints...10 bytes (18 words) - 15:28, 11 December 2023
- one-dimensional case of an NP-hard clustering problem 2020-01-14 Paper On polynomial solvability of one quadratic Euclidean clustering problem on a line 2019-12-13...10 bytes (17 words) - 19:53, 13 December 2023
- PARTIAL INFORMATION 1995-07-19 Paper Generating hard and diverse test sets for NP-hard graph problems 1995-05-17 Paper https://portal.mardi4nfdi.de/entity/Q4763341...10 bytes (18 words) - 18:41, 9 December 2023
- automata 1984-01-01 Paper Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems 1984-01-01 Paper Optimal orientations...10 bytes (19 words) - 09:33, 13 December 2023
- picture languages 2020-05-06 Paper Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program 2019-08-27 Paper Two-way automata...10 bytes (16 words) - 05:12, 13 December 2023
- second-order bounded arithmetic 2014-04-16 Paper Unshuffling a square is NP-hard 2014-02-13 Paper Alternation Trading Proofs and Their Limitations 2013-09-20...10 bytes (19 words) - 14:53, 7 December 2023
- methods 1985-01-01 Paper New NP-hard and NP-complete polynomial and integer divisibility problems 1984-01-01 Paper Complete problems in the first-order predicate...10 bytes (19 words) - 14:32, 8 December 2023
- and processing times. 2004-01-05 Paper An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical...10 bytes (19 words) - 16:59, 9 December 2023
- 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography 2012-08-22 Paper Navigating in a...10 bytes (16 words) - 20:15, 8 December 2023
- solution of NP-hard combinatorial optimization problems 2000-11-23 Paper A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with...10 bytes (17 words) - 17:35, 8 December 2023
- \(\mathbb{NP}\)-hard 2012-11-21 Paper Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in...10 bytes (16 words) - 03:30, 9 December 2023
- not (always) NP-hard 2003-03-19 Paper https://portal.mardi4nfdi.de/entity/Q4790073 2003-01-27 Paper Partitioning a square into rectangles: NP-Completeness...10 bytes (16 words) - 19:44, 13 December 2023
