Podcast #128: We chat with Kent C Dodds about why he loves React and discuss what life was like in the dark days before Git. Listen now.

Profile Activity

Igor Shinkar

Network profile

Reputation

1,848

1.8k
1.7k
1.6k

2016
2017
2018
2019

Top tag

reference-request

Next privilege

2,000 Rep.

Edit questions and answers

Badges

8

20

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

94 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

8 Questions

Views Newest Activity Votes

7

21

votes

1

answer

369

views

Random functions of low degree as a real polynomial

randomness boolean-functions bounded-degree

Oct 30 '18 at 5:54 Bjørn Kjos-Hanssen♦ 4,163

10

18

votes

7

answers

1k

views

Books/Lecture Notes on Parametrized Complexity

reference-request parameterized-complexity fixed-parameter-tractable

Jul 27 at 14:44 Cyriac Antony 296

2

12

votes

2

answers

350

views

$\overline{SAT} \in NTIME(subexp)$?

sat exp-time-algorithms nexp

Sep 12 '15 at 21:37 Huck Bennett 4,254

11

votes

3

answers

590

views

Graph coloring minimizing the number of colors in every independent set

reference-request graph-colouring

May 23 '14 at 14:21 R B 8,985

2

9

votes

0

answers

232

views

A reduction between small cliques problems

reductions clique

Feb 10 '14 at 15:09 Igor Shinkar 1,848

8

votes

1

answer

257

views

NP-hardness on Cayley graphs

np-hardness np-complete

Jun 17 '16 at 11:10 Igor Shinkar 1,848

1

8

votes

1

answer

149

views

Density of Ramsey Graphs

graph-theory ramsey-theory

May 16 '13 at 14:16 Boris Bukh 947

1

6

votes

0

answers

185

views

Bias of a random boolean low degree polynomial

boolean-functions randomness bounded-degree

Oct 23 '14 at 22:59 Community♦ 1

Theoretical Computer Science Stack Exchange works best with JavaScript enabled