Computer Science
nir shahar
  • Member for 1 year, 7 months
  • Last seen this week
Profile Activity

21 Questions

Votes Activity Newest Views
1 answers
4 votes
67 views
1 bookmarks
Combinatorics - how many $c$-distinct sets are possible?
0 answers
4 votes
35 views
Planarity testing given an embedding
1 answers
3 votes
55 views
Number of planar graphs, given an embedding
1 answers
3 votes
89 views
2 bookmarks
Expressing functions using the arithmetic dictionary
2 answers
2 votes
54 views
1 bookmarks
Showing asymptotic lower bound on log of recurrence
1 answers
2 votes
44 views
Existence of good error correcting codes
0 answers
2 votes
49 views
An approximation variant of the halting problem
0 answers
2 votes
40 views
A simple, concise, strong and a formal model of computation
0 answers
2 votes
77 views
Number of planar graphs with linear edges, given a fixed embedding
2 answers
1 votes
79 views
Hash maps vs extending structs / classes
0 answers
1 votes
36 views
Complex structs in Rust, when following ownership rules
1 answers
1 votes
23 views
Convergence of graph neural networks (GNNs)
1 answers
1 votes
44 views
Communication complexity of equality gap problem
2 answers
1 votes
253 views
Weird "proof" recursion
1 answers
1 votes
41 views
"Equality" problem in distributed computation
1 answers
1 votes
121 views
Arthur-Merlin protocol
0 answers
0 votes
17 views
Edge features in Graph Neural Networks
0 answers
0 votes
10 views
Sequence prediction with known information
0 answers
0 votes
44 views
Graph Neural Network models
0 answers
0 votes
41 views
Techniques to prove lower bounds on randomized algorithms
1 answers
0 votes
117 views
"problematic" non-halting inputs for Turing machines

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.