user avatar
user avatar
user avatar
G. Bach
  • Member for 9 years, 3 months
  • Last seen this week
15 votes
Accepted

Matrix Max in less than O(n)

11 votes
Accepted

What's Big O of $\log(n+7)^{\log(n)}$?

9 votes
Accepted

Can you solve 2-sat problem when truth assignments of some variables are determined

8 votes
Accepted

Are all minimum spanning trees optimized for fairness?

7 votes

If set membership problem can be solved for a particular language does this imply that the language is regular?

7 votes

How to implement two stacks in one array?

6 votes

Does coNP-completeness imply NP-hardness?

6 votes

How do computers compute?

6 votes
Accepted

does a DFA converted from NFA always contain 2^Q states?

5 votes

Distributivity of $\omega$-regular expressions

4 votes

Solution for a combinatorial minimization problem

4 votes

Proving Little-Oh notation by definition

4 votes

Questions on the definition of polynomial time

4 votes

Why is the set of all regular expressions classified as context-free, instead of regular?

3 votes

Is there a name/algorithm for this problem related to set cover and CSP?

3 votes
Accepted

When is the output of shortest path $\subset$ MST?

3 votes
Accepted

Sort edges in euclidean graph

3 votes

Basics of Amortised Analysis

2 votes
Accepted

Lines intersections with a point in 1D

2 votes

Are turing machine really countable?

2 votes

Converting graphs to sets of paths

2 votes

Efficiently pick a largest set of non-intersecting line segments

1 vote

A graph in descriptive complexity - is $x$ already a vertex?

1 vote
Accepted

Regex for the language over $\{a,b,c\}$ that contain at least two $a$'s but no two consecutive $b$'s