Skip to main content
Alex Meiburg's user avatar
Alex Meiburg's user avatar
Alex Meiburg's user avatar
Alex Meiburg
  • Member for 10 years, 4 months
  • Last seen more than a month ago
5 votes
Accepted

Is it allowed to do a binary search with an oracle when proving NP-completeness?

3 votes
Accepted

Binary code with constraint

3 votes

Why is ${n \choose 2}$ a $\Theta(n^2)$ computation?

3 votes

Measuring time complexity in the length of the input v/s in the magnitude of the input

2 votes
Accepted

How are pointers modeled on bit-based computer models?

2 votes

Are two strings equal if all deciders for a language take the same amount of time for both?

2 votes
Accepted

Among $k$ unit vectors, find odd set with sum length less than 1

2 votes

Are there any problems that are easy to compute but hard to verify?

1 vote

A simple way to find the feasible region of a system with simple constraints

1 vote

Trying to find all possible combinations

1 vote

Proof of NP-hardness of the k-means clustering problem for $k\geqslant 3$

1 vote

If the Navier-Stokes equations problem is a computable problem, for example a set/language called "L", what are the elements of L?

1 vote
Accepted

Task Manager Performance tab in windows

1 vote
Accepted

Big O Notation - Find a Function That Represents the Statement

0 votes

A greedy algorithm for the bottle filling problem