Command Master's user avatar
Command Master's user avatar
Command Master's user avatar
Command Master
  • Member for 4 years
  • Last seen this week
4 votes

PSPACE≠co-NP?Is the statement true?

3 votes

An efficient way of finding the closest point of a sampled function to another point

3 votes

Is there an elegant algorithm for applying multiple simultaneous search-and-replace operations to a string?

2 votes

Finding Optimal Configuration of Formula without trying every Permutation

2 votes
Accepted

Why aren't promise problems just decision problems; can't we encode the promised inputs in the alphabet?

2 votes

Does it require O(|E|) time to visit all nodes?

2 votes

Can you simulate the following process in $O(N.log N)$

2 votes

Checking equality of self-referential lists

2 votes
Accepted

Is there an algorithm for the distrubution of ducks into ponds?

1 vote

Time complexity of an uneven binary search

1 vote
Accepted

Time bounded Kolmogorov complexity and one way functions

1 vote
Accepted

Universal lower bound of the multi message problem

1 vote
Accepted

Directed weighted multigraph with dynamic edges - shortest path

0 votes

How to show a language is in NP?

0 votes

Assignment problem with maximal partitioning

0 votes

If NP problems are decidable, and decidable is subset of turning recognizable which recognizer can understand them?

0 votes
Accepted

Substitution method for the upper bound of a recurrence without an explicit base case

0 votes

XOR pair frequency queries