Is it known whether a hypothetical P-time NP-complete decision procedure has to find a specific solution to the given constraint satisfaction problem?

score 77 · Answer 8 · 2015-07-07 07:56:57

77

Views

Doubt about claim about complexity of edge coloring powers of the line graph

Published on 07 Jul 2015 - 7:56

score 1.5k · Answer 9 · 2015-07-08 05:27:12

1.5k

Views

Time complexity of a simple factoring algorithm?

Published on 08 Jul 2015 - 5:27

score 3.7k · Answer 10 · 2026-03-26 19:05:08

3.7k

Views

Why finding chromatic number is NP-Hard?

Published on 26 Mar 2026 - 19:05

score 661 · Answer 11 · 2015-07-09 19:13:19

661

Views

Max 2-sat and clause size

Published on 09 Jul 2015 - 19:13

score 250 · Answer 12 · 2026-04-02 10:10:13

250

Views

Evaluating a quadratic form with an inverse of a sparse PD matrix, comparison between using the inverse vs using a Cholseky decomposition

Published on 02 Apr 2026 - 10:10

score 660 · Answer 13 · 2015-07-11 16:28:31

660

Views

Fastest way to find linearly independent columns of a matrix

Published on 11 Jul 2015 - 16:28

score 439 · Answer 14 · 2026-03-30 17:00:19

439

Views

Seeking the Recommendation on Complexity Theory books

Published on 30 Mar 2026 - 17:00

score 130 · Answer 15 · 2015-07-14 21:48:25

130

Views

What is the best time complexity of checking the inequality $a_1x_1 + \cdots + a_mx_m \le K$ to have a non-negative integer solution?

Published on 14 Jul 2015 - 21:48

List Question

The time complexity of the n-ary cartesian product over n sets

Are there slight modifications to NP-complete problems which reduce them to P?

Show that running time of Quick Sort is $\mathcal O(n^2)$ when array contains distinct elements and is sorted in descending order

$O(\text{polylog}(1/\epsilon))$-time Algorithm for Numerical Integration to Within Additive $\epsilon$?

Why doesn't the decision problem for Presburger arithmetic demonstrate that $\mathsf{P} \neq \mathsf{NP}$

Show that $\log^{i} n \in O(n^{j})$ for $i,j > 0 $

Is it known whether a hypothetical P-time NP-complete decision procedure has to find a specific solution to the given constraint satisfaction problem?

Doubt about claim about complexity of edge coloring powers of the line graph

Time complexity of a simple factoring algorithm?

Why finding chromatic number is NP-Hard?

Max 2-sat and clause size

Evaluating a quadratic form with an inverse of a sparse PD matrix, comparison between using the inverse vs using a Cholseky decomposition

Fastest way to find linearly independent columns of a matrix

Seeking the Recommendation on Complexity Theory books

What is the best time complexity of checking the inequality $a_1x_1 + \cdots + a_mx_m \le K$ to have a non-negative integer solution?

Trending Questions

Popular # Hahtags

Popular Questions