Search results
From MaRDI portal
- Paper The NP-completeness column: An ongoing guide 1986-01-01 Paper The NP-completeness column: An ongoing guide 1985-01-01 Paper The NP-completeness column:...10 bytes (19 words) - 08:45, 9 December 2023
- 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 Paper...10 bytes (19 words) - 15:16, 6 December 2023
- de/entity/Q3125562 1997-10-01 Paper Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) 1997-02-28 Paper Completeness and weak completeness under polynomial-size circuits...10 bytes (18 words) - 16:43, 12 December 2023
- Publication Type NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations 2018-04-05 Paper NP-complete...10 bytes (18 words) - 05:48, 13 December 2023
- 2019-12-19 Paper NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations 2018-04-05 Paper NP-complete...10 bytes (18 words) - 05:48, 13 December 2023
- 2019-12-19 Paper NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations 2018-04-05 Paper NP-complete...10 bytes (18 words) - 19:27, 13 December 2023
- COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM 2021-02-17 Paper ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY 2021-02-17 Paper ON...10 bytes (18 words) - 15:19, 10 December 2023
- mappings for balanced data distribution 1996-08-12 Paper On monadic NP vs monadic co-NP 1995-09-17 Paper Finite state verifiers I 1994-11-13 Paper Finite...10 bytes (19 words) - 09:33, 13 December 2023
- PROBLEM 1994-03-27 Paper On completeness for NP via projection translations 1994-03-24 Paper Methods for proving completeness via logical reductions 1993-12-20...10 bytes (18 words) - 00:40, 10 December 2023
- (always) NP-hard 2003-03-19 Paper https://portal.mardi4nfdi.de/entity/Q4790073 2003-01-27 Paper Partitioning a square into rectangles: NP-Completeness and approximation...10 bytes (16 words) - 19:44, 13 December 2023
- Clause Learning 2009-04-29 Paper The NP-Completeness of Reflected Fragments of Justification Logics 2009-02-24 Paper The NP-hardness of finding a directed acyclic...10 bytes (19 words) - 14:53, 7 December 2023
- complexity theory 1998-11-03 Paper \(\text{NP}\not={co}\)-NP and models of arithmetic 1997-02-28 Paper P, NP, Co-NP and weak systems of arithmetic 1997-02-28...10 bytes (16 words) - 11:02, 11 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...10 bytes (19 words) - 14:32, 8 December 2023
- Zero-One Laws 2009-03-12 Paper Comparing Reductions to NP-Complete Sets 2009-03-12 Paper Splitting NP-Complete Sets 2008-10-28 Paper Hardness hypotheses, derandomization...10 bytes (16 words) - 23:05, 24 September 2023
- nearest neighbor interchange metric for unlabeled binary trees is NP-complete 1986-01-01 Paper NP-hard problems in hierarchical-tree clustering 1986-01-01 Paper...10 bytes (16 words) - 16:53, 12 December 2023
- 2013-07-23 Paper Skew partition sandwich problem is NP-complete 2013-07-19 Paper The P versus NP-complete dichotomy of some challenging problems in graph theory...10 bytes (22 words) - 10:24, 8 December 2023
- key encapsulation using dyadic GS codes 2019-01-11 Paper \(\mathcal{NP}\)-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding...10 bytes (18 words) - 03:12, 10 December 2023
- Mechanism for Shells 2001-10-01 Paper The NP-Completeness of Some Edge-Partition Problems 1981-01-01 Paper The NP-Completeness of Edge-Coloring 1981-01-01 Paper...10 bytes (16 words) - 13:31, 28 January 2024
- degrees and \(P=?NP\) 1987-01-01 Paper Minimal degrees for polynomial reducibilities 1987-01-01 Paper On simple and creative sets in NP 1986-01-01 Paper...10 bytes (16 words) - 15:10, 6 December 2023
- Relations and #P-Completeness 2007-05-02 Paper A degree bound on decomposable trees 2006-04-28 Paper Vandermonde matrices, NP-completeness and transversal...10 bytes (17 words) - 03:07, 9 December 2023
