Skip to main content
Tassle's user avatar
Tassle's user avatar
Tassle's user avatar
Tassle
  • Member for 4 years, 10 months
  • Last seen more than a week ago
3 votes
Accepted

Prove "Vertex Cover OR Clique" is NP complete

2 votes
Accepted

How many games will a “MENACE” tic tac toe computer take to train

3 votes
Accepted

If a problem A in NP is reducible in polyomial time to a problem B, can one say that B must also be in NP?

4 votes
Accepted

is there an efficient algorithm to find the optimal partition of a matrix?

0 votes

Time complexity of algorithm involving function calls

1 vote

Calculating cells encompassing points in a grid

1 vote
Accepted

Finding the error probability of a Monte Carlo algorithm

1 vote

Rotating sort algorithm

1 vote

Convex polygon triangulation with stabbing number O(log n)

2 votes
Accepted

A query regarding Strongly NP Complete problem reduction/definition

1 vote

Algorithm to find if there exists an assignment such that all equality and inequality constraints are satisfied

1 vote

is it possible to compress a sequence of progressive unique numbers dramatically?

4 votes
Accepted

The optimal complexity of intersecting a line with a convex hull of a set of points in 2d

1 vote

Fastest Algorithm for "Merge" step in Mergesort

1 vote
Accepted

Upper bound of sum of codewords lengths

0 votes

Enumeration of a class of languages

1 vote
Accepted

Combinatorics - how many $c$-distinct sets are possible?

3 votes

Iteration Vs Induction Method

3 votes
Accepted

Find the largest rectangle inscribed in a region partitionable into rectangles

4 votes
Accepted

Weird "proof" recursion

4 votes
Accepted

Prove that any algorithm that has sublinear time have a constant time complexity?

1 vote
Accepted

Job Shop Problem: How do you get an ordered sequence of operations from the disjunctive acyclic graph?

0 votes

How/why is switch made from equation to inequality for certificate of optimality for dual problem in linear programming?

2 votes

Dynamic programming for graph splitting

2 votes
Accepted

Is there a binary representation where the encoding distance grows with the arithmetic distance?

2 votes

Big Oh and Big Omega when $n$ and $\log n$ terms are in $f(n)$

2 votes
Accepted

How to avoid monochromatic cycles?

4 votes
Accepted

Group time series events into minimal amount of buckets

2 votes

Trouble finding average case of a find max algorithm

1 vote

Polynomial-time algorithm to solve the maximum vertex bipartite subgraph problem