Search results
From MaRDI portal
- 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
- unknotting 2021-03-10 Paper Embeddability in R 3 is NP-hard 2020-11-11 Paper Link crossing number is NP-hard 2020-08-27 Paper On the tree-width of knot diagrams...10 bytes (16 words) - 07:56, 9 December 2023
- 2015-05-11 Paper Reachability Problems for Hierarchical Piecewise Constant Derivative Systems 2014-07-07 Paper Decision Problems for Probabilistic Finite Automata...10 bytes (18 words) - 11:14, 11 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
- 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
- optimization problem 2020-12-29 Paper Correction to: ``Trading off worst and expected cost in decision tree problems 2019-01-11 Paper Decision trees for function...10 bytes (18 words) - 15:00, 9 December 2023
- Connectivity Have Depth (log n)2-o(1) 1998-09-20 Paper On approximating NP-hard optimization problems 1998-08-05 Paper The Shrinkage Exponent of de Morgan Formulas...10 bytes (19 words) - 23:46, 8 December 2023
- multiplication is hard for depth-two circuits 2010-05-10 Paper On convex complexity measures 2010-04-15 Paper On the P versus NP intersected with co-NP question...10 bytes (18 words) - 11:32, 8 December 2023
- Constructive Control 2009-12-10 Paper How Hard Is Bribery in Elections? 2009-12-10 Paper Generalized juntas and NP-hard sets 2009-09-10 Paper Guarantees for...10 bytes (18 words) - 15:10, 6 December 2023
- covers is complete for parallel access to NP 2006-02-22 Paper All superlinear inverse schemes are coNP-hard 2005-12-06 Paper Extending Downward Collapse...10 bytes (17 words) - 16:06, 10 December 2023
- Planar Counting Problems 1998-09-20 Paper Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems 1998-09-20 Paper...10 bytes (21 words) - 08:05, 9 December 2023
- Paper An ETH-Tight Exact Algorithm for Euclidean TSP 2023-06-09 Paper Problems hard for treewidth but easy for stable gonality 2023-05-05 Paper Typical sequences...10 bytes (19 words) - 07:47, 9 December 2023
- 1992-06-26 Paper Space-time isomorphism problem is intractable (NP-hard) 1991-01-01 Paper Algorithmic problems of nontransitive (SSB) utilities 1991-01-01...10 bytes (19 words) - 18:33, 8 December 2023
- and number-theoretic problems 1979-01-01 Paper On the space complexity of recursive algorithms 1979-01-01 Paper Some decision problems concerning sequential...10 bytes (18 words) - 10:01, 24 September 2023
- THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS 2011-01-19 Paper On decision problems for parameterized machines...10 bytes (16 words) - 23:24, 9 December 2023
- search problems 2007-01-08 Paper SOFSEM 2006: Theory and Practice of Computer Science 2006-11-14 Paper On the structure of parameterized problems in NP 2006-10-10...10 bytes (19 words) - 14:23, 28 January 2024
- on ordered binary decision diagrams 2008-05-08 Paper Consequences of the provability of NP ⊆ P/poly 2008-02-25 Paper NP search problems in low fragments...10 bytes (17 words) - 12:15, 9 December 2023
- of algorithms to increase the computational effectiveness of NP-hard scheduling problems 1998-10-07 Paper...10 bytes (18 words) - 17:24, 24 September 2023
- Design Problems 1998-12-02 Paper https://portal.mardi4nfdi.de/entity/Q4375775 1998-07-13 Paper NC-Approximation Schemes for NP- and PSPACE-Hard Problems...10 bytes (19 words) - 05:05, 9 December 2023
- or decision problem in different computational models 2002-11-20 Paper On the computational structure of the connected components of a hard problem 2002-07-25...10 bytes (17 words) - 20:26, 11 December 2023
