Network profile

Banach Tarski

Reputation

1,148

1.1k
1k
856

2018
2019
2020
2021

Top tag

algorithms

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Next badge

1/30

Impact

9 posts edited

4 helpful flags

89 votes cast

14 Questions

Votes Activity Newest Views

votes

answer

views

Konig's Theorem for Min Weight Vertex Cover?

weighted-graphs bipartite-matching

Nov 30 '17 at 17:42 Banach Tarski 1,148

votes

answers

views

How do you compute the time complexity of distributed algorithms?

algorithm-analysis runtime-analysis distributed-systems

May 1 '17 at 15:49 Jukka Suomela 1,935

vote

answers

views

Minimum Cost Max Flow with Negative Weight Cycles?

algorithms optimization network-flow max-flow

Aug 25 '16 at 9:55 Raphael♦ 69k

votes

answers

710

views

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

computability combinatorics primitive-recursion uncountability

Jan 29 '20 at 1:41 vonbrand 12.5k

votes

answers

691

views

Lower Bounds for Size of Independent Set in a Graph?

graphs satisfiability lower-bounds

Apr 4 '16 at 11:37 KKS 345

vote

answer

401

views

Turing Machine that always returns a blank tape

computability turing-machines

May 1 '16 at 16:24 Yuval Filmus 241k

votes

answer

359

views

Implications of Halting Problem being unsolvable?

computability turing-machines reductions

May 2 '16 at 13:21 Lieuwe Vinkhuijzen 4,047

vote

answer

343

views

Prove Undecidability Without Using Rice's Theorem

computability turing-machines reductions

May 1 '16 at 20:06 Lieuwe Vinkhuijzen 4,047

votes

answer

256

views

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

computability turing-machines undecidability

Aug 8 '16 at 8:42 Raphael♦ 69k

votes

answer

239

views

Approximation Algorithm for the Unique Coverage Problem

algorithms approximation

Sep 24 '16 at 18:34 Banach Tarski 1,148

votes

answers

117

views

Distributed Algorithm for Minimum Cost Maximum Matching in General Graphs

algorithms reference-request distributed-systems matching

Sep 15 '16 at 10:59 Raphael♦ 69k

votes

answers

views

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

distributed-systems upper-bound

Oct 3 '16 at 18:06 Banach Tarski 1,148

votes

answer

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})$

trees upper-bound

Aug 21 '16 at 22:13 Yuval Filmus 241k

vote

answers

views

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

research

Mar 13 '17 at 7:09 Banach Tarski 1,148

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

14 Questions

Konig's Theorem for Min Weight Vertex Cover?

How do you compute the time complexity of distributed algorithms?

Minimum Cost Max Flow with Negative Weight Cycles?

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

Lower Bounds for Size of Independent Set in a Graph?

Turing Machine that always returns a blank tape

Implications of Halting Problem being unsolvable?

Prove Undecidability Without Using Rice's Theorem

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

Approximation Algorithm for the Unique Coverage Problem

Distributed Algorithm for Minimum Cost Maximum Matching in General Graphs

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

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})$

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