## Tag: np

33 How hard is reconstructing a permutation from its differences sequence? 2013-07-07T01:01:20.217

20 Why relativization can't solve NP !=P? 2010-08-15T15:45:47.590

19 Satisfiability of general Boolean formulas with at most two occurrences per variable 2009-12-21T22:29:05.297

18 Super-linear time complexity lower bounds for any natural problem in NP? 2009-11-11T00:27:06.913

16 NP-hardness of finding 0-1 vector to maximize rows of {-1, +1} matrix 2017-12-10T06:28:20.187

15 Representing mathematical statements as SAT instances 2017-12-27T12:37:59.317

14 What techniques exist to show that a problem is not NP-complete? 2009-12-18T01:44:23.433

14 SAT and Arithmetic Geometry 2012-12-06T13:43:11.540

12 Best-case Running-time to solve an NP-Complete problem 2009-11-22T01:39:49.157

11 What impact would P!=NP have on the characterization of BQP? 2010-08-10T17:52:00.270

10 Testing contrasts in statistics: Is this provably a hard problem, or not? 2013-06-04T22:35:50.433

10 Is there a polynomial-time algorithm for untangling the unknot? 2016-12-07T11:42:04.943

9 Is this a well known NP-complete problem? 2010-03-31T15:04:20.083

9 Conjecture on NP-completeness of tesselation of Wang Tile up to finite size 2014-02-16T03:19:43.730

8 Non-existence of algorithm converting NP algorithm to P algorithm? 2010-06-11T20:34:41.773

8 How to find nearest lattice point to given point in R^n ? Is it NP ? 2011-04-16T08:02:37.033

8 Is this problem on weighted bipartite graph solvable in polynomial time or it is NP-Complete 2014-09-02T21:19:18.230

7 Characterize P^NP (a.k.a. Delta_2^p) 2009-10-23T23:16:32.270

7 one-dimensional (sort of) tilings 2012-07-11T08:55:58.390

7 NP-hard problems in linear algebra and real analysis 2014-04-01T22:52:21.847

7 How slow are direct solutions of NP-complete problems on computers? 2016-09-01T10:28:48.493

6 NP-hardness of a graph partition problem? 2012-03-03T16:00:05.167

6 Is Logical Min-Cut Problem, NP-Complete? 2012-04-26T08:37:37.827

5 Minimal Backtracking Proof Tree 2010-05-04T22:58:41.910

5 Is pattern recognition NP-complete? 2010-12-11T16:45:30.667

5 Closest vector problem (=nearest lattice point) is trivial for "reduced lattice" ? 2011-04-18T12:37:48.080

5 Any approximation algorithms for self-avoiding walks? 2011-09-30T14:25:25.367

5 Are there sampNP-intermediate problems? 2012-12-28T13:18:01.790

4 BPP being equal to #P under Oracle 2010-01-04T18:17:29.950

4 Constructing hard inputs for the complement of bounded halting 2010-08-26T21:04:17.340

3 0,1 solution to system of linear integer equations 2012-03-28T17:04:30.783

3 Partitioning a cubic graph into two induced cycles of equal order 2014-01-31T20:11:01.123

3 Is the domination number NP for non-bipartite graphs? 2014-03-05T15:27:59.583

3 What impact would P=BQP have on NP? 2014-08-09T18:52:08.817

3 reduction to np hard ordering problem 2014-08-23T16:40:34.850

3 Can we say that this problem is NP-hard? 2015-12-15T21:34:40.687

3 Covering a graph by trees with depth constraint 2016-04-19T06:23:17.577

3 What arguments do exist against defining completeness in NP using injective Karp reductions? 2016-09-30T23:18:42.470

3 Simple cake cutting puzzle 2016-12-11T05:18:42.240

3 (How) do Better TSP Heuristics help in Answering the $NP=P$ Question? 2017-12-19T21:31:37.170

3 Techniques for proving relaxed one-wayness of functions 2018-01-05T17:01:54.250

2 poly-time algorithm to choose elements of sets 2010-06-10T17:57:24.907

2 Complexity of a variant of the Mandelbrot set decision problem? 2010-09-27T15:54:12.117

2 Could this be a NP complete? 2011-05-07T20:37:11.077

2 #P version of SUBSET SUM 2012-04-24T02:22:29.797

2 Need input on a potentially NP-hard maximal edge-weighted multi-cycle graph 2012-05-23T23:32:40.940

2 Intermediate $\mathsf{NP}$-complete problems? 2013-06-15T17:37:42.080

2 Reference Request for: Finding Large Bipartite Subgraphs via Destruction of Odd Cycles in Graphs 2013-07-28T18:12:38.297

2 Simple example of why Differential Equations can be NP Hard 2014-02-19T18:57:25.613

2 Is undirected short-simple-path-through-3-vertices decidable in polynomial time? 2014-03-28T20:53:39.427

2 NP-hardness of finding maximum of minimum element in diagonal of a matrix 2015-01-16T00:49:30.793

2 How hard is recognizing a permutation that is a square for the shift product? 2015-09-23T21:03:07.073

2 On Knot Equivalence problem statement 2015-12-08T07:02:09.937

2 Minimal Support Solutions of a Linear System (Dissertation) 2016-02-09T15:48:18.723

2 How to complete the NP-hardness proof of GENERAL-SQUARE-PRODUCT? 2016-02-22T17:47:25.580

2 Minimum cover for sets in which each element appears in exactly 2 sets? 2016-04-17T22:13:49.403

1 Quantum computation implications of (P vs NP) 2010-08-10T18:49:20.333

1 Self-improvement property of optimazation problems? 2010-09-16T16:33:08.000

1 Knapsack Problem Specifics 2011-08-07T22:25:46.567

1 Is this minimization problem NP-Complete ? 2011-08-28T13:36:30.133

1 Non-trivial lower bound on the number of "Graph Diagonals" 2013-03-09T17:44:17.700

1 Are set covering problems with nonlinear cost functions NP-Hard? 2013-05-02T11:32:24.293

1 Strategic vertex labeling 2013-05-12T16:53:49.547

1 The complexity of Max-K interval selection 2016-02-03T03:07:10.100

1 Cost associated set problem NP-hard 2017-10-09T08:16:49.183

0 How can one characterize NP^SAT? 2009-10-23T06:29:03.980

0 A few questions about Computational Problems Complexity Classification 2010-10-06T20:50:43.363

0 A simplified/harder 2-sequence longest common sub-sequence (LCS) problem 2012-09-01T12:47:16.687

0 Generating 3SAT circuit for Integer factorization example 2013-05-02T04:41:50.613

0 How to determine the distance between two matrices under the meaning of a matrix function? 2014-02-09T09:59:07.413

0 Surd Partition Problem 2015-01-16T00:37:02.230

0 Efficient recognition of sequences sortable by transpositions? 2015-08-12T10:11:16.703

0 Continuous backpack with multiple choice items. NP prove 2016-12-01T13:31:53.533

0 Finding a subgraph of cliques with the minimum total sum weight 2017-01-04T19:38:30.707

0 Proving a Property of Crossing Generalized Diagonals 2017-12-26T10:04:50.770

-1 Is finding a local minimizer of a NP-hard optimization problem is still NP-hard 2016-01-26T05:21:07.630