Theoretical Computer Science
Profile Activity
Meta user
Network profile
1,925
reputation
1
10
20

joro

Hi,

My name is Georgi Guninski.

Contact:

gguninski@gmail.com

guninski@guninski.com

For introduction see resume.

12
answers
34
questions
~20k
people reached
  • guninski.com
  • Member for 7 years, 1 month
  • 442 profile views
  • Last seen Jan 9 at 10:35

Communities (9)

Top network posts

Top tags (31)

Score 16
Posts 21
Posts % 46
Score 7
Posts 34
Score 5
Posts 4
Score 4
Posts 12
Score 4
Posts 8
Score 4
Posts 4
View all tags →

Top posts (46)

All Questions Answers
Votes Newest
27 Are there subexponential algorithms for PLANAR SAT known? Mar 21 '15
11 Polynomial problems in graph classes defined by forbidden induced cyclic subgraphs Jun 13 '14
11 Confusion about reduction counting vertex covers to counting cycle covers Jun 28 '14
10 When polynomial GI implies polynomial (edge) colored GI? Oct 2 '14
10 Is square removal easier than factoring? Jan 18 '15
8 Complexity results about locally bipartite graphs Jan 16 '15
7 The Overfull conjecture in graph theory and $coNP$ Jun 18 '14
7 Several papers appear to imply P=NP via chordal graphs, what is wrong? Mar 12 '15
6 Complexity of coloring in weakly perfect graphs? Jan 23 '15
5 Reduction from SAT to 0,1 integer linear program with zero or one solutions Jul 17 '14
View all questions and answers →

Badges (31)

Gold

1

Rarest

Silver

10

Rarest

Bronze

20

Rarest

View all badges →

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.