Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • 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
  • 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
  • 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
  • 2^{n/2})\) time and \(O(k\cdot s^{n/k})\) space algorithm for certain NP-complete problems 1990-01-01 Paper Making bubblesort recursive 1990-01-01 Paper...
    10 bytes (16 words) - 10:14, 12 December 2023
  • Definability in Monadic Second - Order Logic 1997-04-08 Paper Complete problems for monotone NP 1997-02-28 Paper Finding regular subgraphs in both arbitrary...
    10 bytes (18 words) - 00:40, 10 December 2023
  • Boolean Hierarchy Collapses 1992-06-25 Paper \(P^{NP[O(\log n)}\) and sparse turing-complete sets for NP] 1989-01-01 Paper The Polynomial Time Hierarchy...
    10 bytes (16 words) - 04:43, 13 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
  • 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
  • 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
  • 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
  • 1990-01-01 Paper A Nontrivial Lower Bound for an NP Problem on Automata 1990-01-01 Paper A Natural NP-Complete Problem with a Nontrivial Lower Bound 1988-01-01...
    10 bytes (16 words) - 22:53, 10 December 2023
  • Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles 2019-06-14 Paper Almost partitioning 2‐colored complete 3‐uniform hypergraphs...
    10 bytes (18 words) - 22:59, 9 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
  • 2016-08-17 Paper Unions of Disjoint NP-Complete Sets 2015-09-07 Paper Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes 2014-10-14...
    10 bytes (16 words) - 12:05, 6 October 2023
  • Paper Fast-Growing Functions and the P vs. NP Question 2008-01-18 Paper On the metamathematics of the P vs. NP question 2007-09-19 Paper Informal versus...
    10 bytes (19 words) - 04:05, 13 December 2023
  • problems 2017-12-20 Paper The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy 2017-12-20 Paper Parameterized complexity...
    10 bytes (16 words) - 10:24, 8 December 2023
  • 2015-12-30 Paper Flip distance between triangulations of a simple polygon is NP-complete 2015-12-02 Paper Reconstructing Point Set Order Typesfrom Radial Orderings...
    10 bytes (17 words) - 13:28, 8 December 2023
  • Paper On reductions of NP sets to sparse sets 1995-02-13 Paper Immunity of complete problems 1995-01-12 Paper Minimal pairs and complete problems 1994-09-25...
    10 bytes (16 words) - 15:10, 6 December 2023
  • Span-Dependent Instructions 1979-01-01 Paper Microcode Bit Optimization is NP-Complete 1979-01-01 Paper Properties of Conflict-Free and Persistent Petri Nets...
    10 bytes (18 words) - 23:42, 12 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)