Computer Science
Dingle Berry's user avatar
Dingle Berry's user avatar
Dingle Berry's user avatar
Dingle Berry
  • Member for 3 years, 11 months
  • Last seen more than 3 years ago
Profile Activity

12 Questions

Score Activity Newest Views
0 votes
1 answer
215 views

Is my reasoning wrong that $PSPACE$ should not equal $EXPTIME$?

0 votes
1 answer
102 views

Is the complement of this decision problem in $P$?

1 vote
1 answer
92 views

Must a decision problem in $NP$ have a complement in $Co-NP$, if I can verify the solutions to in polynomial-time?

0 votes
1 answer
75 views

Will this reduction of Exact Cover into Subset-Sum fail due to a potential false positive?

1 vote
1 answer
72 views

If anything can be verified efficiently, must it be solvable efficiently on a Non-Deterministic machine?

0 votes
1 answer
61 views

Variant of Subset-sum has an $O(1)$ algorithm if $Goldbach$ is true

0 votes
1 answer
56 views

Is there a polynomial time algorithm for this decision problem?

0 votes
0 answers
51 views

Would this algorithm fail to count solutions $>$ $1$ for Exact-3-cover?

0 votes
1 answer
38 views

If a decision problem is in $P$, must finding the solution be possible in polynomial-time?

0 votes
1 answer
37 views

Is this algorithm for Exact Three Cover sub-exponential, because I find $length(s)/3$ combinations for $C$?

1 vote
1 answer
37 views

Do any single-cell organisms exist that approximate NP-hard problems within a factor better than $1/2$ $log$2?

0 votes
0 answers
31 views

Algorithm always provide a $2$_$sum$ with at least ONE prime? In polynomial-time?