Search results

From MaRDI portal
View ( | ) (20 | 50 | 100 | 250 | 500)
  • 2010-04-21 Paper Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete 2009-12-15 Paper Complete solutions...
    10 bytes (18 words) - 22:34, 8 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
  • de/entity/Q3886862 1980-01-01 Paper Even initial feedback vertex set problem is NP-complete 1979-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3851625 1979-01-01...
    10 bytes (16 words) - 00:06, 13 December 2023
  • quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP 2022-12-09 Paper Total nondeterministic Turing machines...
    10 bytes (16 words) - 12:40, 24 September 2023
  • Deciding whether a grid is a topological subgraph of a planar graph is NP-complete 2022-04-27 Paper Polynomial degeneracy for the first \(m\) energy levels...
    10 bytes (16 words) - 23:42, 10 December 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
  • Diameter bounds for altered graphs 1984-01-01 Paper Crossing Number is NP-Complete 1983-01-01 Paper Dynamic Bin Packing 1983-01-01 Paper Scheduling Opposing...
    10 bytes (19 words) - 09:29, 13 December 2023
  • Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes 2014-10-14 Paper Autoreducibility of Complete Sets for Log-Space and Polynomial-Time...
    10 bytes (16 words) - 05:37, 7 October 2023
  • approximate minimum vertex covers is complete for parallel access to NP 2006-02-22 Paper All superlinear inverse schemes are coNP-hard 2005-12-06 Paper Extending...
    10 bytes (17 words) - 16:06, 10 December 2023
  • Paper Splitting NP-Complete Sets 2008-10-28 Paper Non-mitotic Sets 2008-04-24 Paper Redundancy in Complete Sets 2008-03-19 Paper Autoreducibility, mitoticity...
    10 bytes (17 words) - 13:24, 7 October 2023
  • of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP 2018-07-04 Paper Pseudorandom generators and the frequency...
    10 bytes (18 words) - 15:10, 6 December 2023
  • Paper Selecting the Median 1999-10-28 Paper Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture 1998-02-10 Paper https://portal.mardi4nfdi...
    10 bytes (16 words) - 21:16, 8 December 2023
  • Computer Science 2005-12-08 Paper Tight lower bounds for certain parameterized NP-hard problems 2005-10-10 Paper Mathematical Foundations of Computer Science...
    10 bytes (18 words) - 16:43, 12 December 2023
  • Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$ 2017-06-01 Paper A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography 2017-06-01...
    10 bytes (18 words) - 03:12, 10 December 2023
  • induced subgraph sandwich problem NP-completeness 2022-04-27 Paper The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy 2017-12-20...
    10 bytes (18 words) - 09:19, 7 October 2023
  • authentication 1982-01-01 Paper Optimal packing and covering in the plane are NP-complete 1981-01-01 Paper...
    10 bytes (18 words) - 20:16, 12 December 2023
  • Paper Packing cubes into a cube is NP-complete in the strong sense 2015-07-10 Paper Packing Cubes into a Cube Is NP-Hard in the Strong Sense 2013-06-11...
    10 bytes (16 words) - 16:21, 10 December 2023
  • isomorphism polytopes 2022-06-09 Paper On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation 2019-05-03 Paper Boolean quadric...
    10 bytes (18 words) - 19:52, 13 December 2023
  • 2015-09-24 Paper Unions of Disjoint NP-Complete Sets 2015-09-07 Paper Strong Reductions and Isomorphism of Complete Sets 2015-02-24 Paper Base invariance...
    10 bytes (18 words) - 10:24, 7 October 2023
  • Paper The Complete Convergence of Best Fit Decreasing 1989-01-01 Paper Optimal Bin Covering with Items of Random Size 1989-01-01 Paper The Complete Convergence...
    10 bytes (18 words) - 09:42, 12 December 2023
View ( | ) (20 | 50 | 100 | 250 | 500)