Network profile

nir shahar

Reputation

5,384

top 0.30% this quarter

5.4k
3.1k
913

Top tag

time-complexity

Next privilege

10,000 Rep.

Access moderator tools

Badges

Newest

Cleanup

Next badge

85/100

Impact

32 posts edited

16 helpful flags

437 votes cast

18 Questions

Votes Activity Newest Views

votes

answers

views

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

combinatorics sets

May 23 at 11:24 nir shahar 5,384

votes

answers

views

Planarity testing given an embedding

algorithms graphs planar-graphs

Mar 10 at 17:12 nir shahar 5,384

votes

answer

views

Number of planar graphs, given an embedding

graphs lower-bounds upper-bound

Mar 23 at 9:17 Yuval Filmus 254k

votes

answer

views

Existence of good error correcting codes

reference-request error-correcting-codes

Jun 10 at 9:28 nir shahar 5,384

votes

answers

views

An approximation variant of the halting problem

undecidability approximation halting-problem

May 25 at 0:54 John L. 26.1k

votes

answers

views

A simple, concise, strong and a formal model of computation

computation-models

Apr 17 at 0:00 nir shahar 5,384

votes

answers

views

Number of planar graphs with linear edges, given a fixed embedding

graphs lower-bounds upper-bound

Mar 24 at 10:52 nir shahar 5,384

votes

answer

views

Showing asymptotic lower bound on log of recurrence

recurrence-relation lower-bounds

Mar 15 at 1:26 John L. 26.1k

votes

answer

views

Expressing functions using the arithmetic dictionary

turing-machines computation-models first-order-logic

May 28 '20 at 22:58 Beleg 332

vote

answer

views

Communication complexity of equality gap problem

approximation lower-bounds communication-complexity

Jun 9 at 3:58 Yuval Filmus 254k

vote

answers

241

views

Weird “proof” recursion

logic

May 27 at 11:03 Arno 1,534

vote

answer

views

“Equality” problem in distributed computation

graphs distributed-systems lower-bounds

Feb 4 at 8:22 D.W.♦ 132k

vote

answer

views

Arthur-Merlin protocol

complexity-theory complexity-classes protocols

Jun 29 '20 at 20:44 prime_hit 918

votes

answers

views

Edge features in Graph Neural Networks

reference-request neural-networks

Jun 3 at 9:06 nir shahar 5,384

votes

answers

views

Sequence prediction with known information

machine-learning

May 13 at 0:17 nir shahar 5,384

votes

answers

views

Graph Neural Network models

graphs machine-learning

Apr 29 at 14:04 nir shahar 5,384

votes

answers

views

Techniques to prove lower bounds on randomized algorithms

complexity-theory lower-bounds probabilistic-algorithms

Feb 11 at 0:52 nir shahar 5,384

votes

answer

115

views

“problematic” non-halting inputs for Turing machines

turing-machines semi-decidability

Jun 5 '20 at 8:18 Glorfindel 650

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

18 Questions

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

Planarity testing given an embedding

Number of planar graphs, given an embedding

Existence of good error correcting codes

An approximation variant of the halting problem

A simple, concise, strong and a formal model of computation

Number of planar graphs with linear edges, given a fixed embedding

Showing asymptotic lower bound on log of recurrence

Expressing functions using the arithmetic dictionary

Communication complexity of equality gap problem

Weird “proof” recursion

“Equality” problem in distributed computation

Arthur-Merlin protocol

Edge features in Graph Neural Networks

Sequence prediction with known information

Graph Neural Network models

Techniques to prove lower bounds on randomized algorithms

“problematic” non-halting inputs for Turing machines