nir shahar

Reputation

9,132

9.1k
5.3k
1.5k

Top tag

time-complexity

Next privilege

10,000 Rep.

Access moderator tools

Badges

Newest

Good Answer

Next badge

535/600

Impact

54 posts edited

16 helpful flags

857 votes cast

20 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 9,132

votes

answers

views

Planarity testing given an embedding

algorithms graphs planar-graphs

Mar 10 at 17:12 nir shahar 9,132

votes

answer

views

Number of planar graphs, given an embedding

graphs lower-bounds upper-bound

Mar 23 at 9:17 Yuval Filmus 259k

votes

answers

views

Showing asymptotic lower bound on log of recurrence

recurrence-relation lower-bounds

Jul 17 at 8:14 Jut 1

votes

answer

views

Existence of good error correcting codes

reference-request error-correcting-codes

Jun 10 at 9:28 nir shahar 9,132

votes

answers

views

An approximation variant of the halting problem

undecidability approximation halting-problem

May 25 at 0:54 John L. 26.8k

votes

answers

views

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

computation-models

Apr 17 at 0:00 nir shahar 9,132

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 9,132

votes

answer

views

Expressing functions using the arithmetic dictionary

turing-machines computation-models first-order-logic

May 28 '20 at 22:58 Beleg 322

vote

answers

views

Complex structs in Rust, when following ownership rules

rust

Sep 3 at 17:36 nir shahar 9,132

vote

answer

views

Convergence of graph neural networks (GNNs)

graphs reference-request neural-networks

Jul 6 at 5:24 Juho 21.6k

vote

answer

views

Communication complexity of equality gap problem

approximation lower-bounds communication-complexity

Jun 9 at 3:58 Yuval Filmus 259k

vote

answers

251

views

Weird "proof" recursion

logic

May 27 at 11:03 Arno 1,819

vote

answer

views

"Equality" problem in distributed computation

graphs distributed-systems lower-bounds

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

vote

answer

110

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 9,132

votes

answers

views

Sequence prediction with known information

machine-learning

May 13 at 0:17 nir shahar 9,132

votes

answers

views

Graph Neural Network models

graphs machine-learning

Apr 29 at 14:04 nir shahar 9,132

votes

answers

views

Techniques to prove lower bounds on randomized algorithms

complexity-theory lower-bounds probabilistic-algorithms

Feb 11 at 0:52 nir shahar 9,132

votes

answer

116

views

"problematic" non-halting inputs for Turing machines

turing-machines semi-decidability

Jun 5 '20 at 8:18 Glorfindel 664

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

20 Questions

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

Planarity testing given an embedding

Number of planar graphs, given an embedding

Showing asymptotic lower bound on log of recurrence

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

Expressing functions using the arithmetic dictionary

Complex structs in Rust, when following ownership rules

Convergence of graph neural networks (GNNs)

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