Skip to main content
Share Your Experience: Take the 2024 Developer Survey
holf's user avatar
holf's user avatar
holf's user avatar
holf
  • Member for 7 years, 5 months
  • Last seen this week
12 votes
Accepted

Proof that TAUT is coNP-complete (or that a problem is coNP-complete if its complement is NP-complete)

7 votes
Accepted

Is #HORNSAT polynomial?

7 votes
Accepted

What does the $O^*$ notation mean?

6 votes
Accepted

Relationship between the parameters tree width and the maximum degree

6 votes

Is the halting problem claim true with the advent of AI

5 votes
Accepted

A minimal automaton for a language quotient $w^{-1}L$ if $L$ is regular

4 votes
Accepted

Proof that n^2 = O(logn)?

3 votes

Regular Expression with at least one a, even number of b

3 votes
Accepted

Non adjacent sum: Why do we need to include or exclude the current element?

3 votes
Accepted

All the keys in a binary search tree should be greater than or equal to the root of the tree, is my understanding correct?

3 votes
Accepted

SAT solvers for counting the number of solutions

3 votes

SAT formula and satisfying assignment yield another different satisfying assignment

3 votes
Accepted

Can the Same Function Have Different Asymptotic?

1 vote

Doubt with the halting problem undecidable proof

1 vote
Accepted

Every state in subset automaton is reachable

1 vote

Problem of finding a very independent set of size at least $k$ is NP-Complete