Computer Science
Banach Tarski's user avatar
Banach Tarski's user avatar
Banach Tarski's user avatar
Banach Tarski
  • Member for 8 years, 1 month
  • Last seen more than 3 years ago
Profile Activity

14 Questions

Score Activity Newest Views
6 votes
1 answer
3k views

Konig's Theorem for Min Weight Vertex Cover?

7 votes
2 answers
3k views

How do you compute the time complexity of distributed algorithms?

2 votes
0 answers
1k views

Minimum Cost Max Flow with Negative Weight Cycles?

7 votes
2 answers
1k views

Lower Bounds for Size of Independent Set in a Graph?

5 votes
4 answers
919 views

Showing that the number of primitive-recursion programs for each function is countably-infinite

1 vote
1 answer
673 views

Turing Machine that always returns a blank tape

1 vote
1 answer
564 views

Prove Undecidability Without Using Rice's Theorem

0 votes
1 answer
477 views

Implications of Halting Problem being unsolvable?

2 votes
1 answer
340 views

Is it undecidable if the language of a given Turing Machine is the set of composite numbers?

3 votes
1 answer
300 views

Approximation Algorithm for the Unique Coverage Problem

0 votes
0 answers
123 views

Distributed Algorithm for Minimum Cost Maximum Matching in General Graphs

2 votes
0 answers
78 views

What is the largest number of Byzantine failures that can be tolerated in an $m$-dimensional hypercube for the consensus problem?

3 votes
1 answer
59 views

Sum of size of distinct set of descendants $d$ distance from a node $u$, over all $u$ and $d$ is $\mathcal{O}(n\sqrt{n})$

1 vote
0 answers
36 views

Soft Question : Is there any website for weak negative results?