Theoretical Computer Science
Meta user
Network profile
3,226
reputation
16
27

Colin McQuillan

Apparently, this user prefers to keep an air of mystery about them.

35
answers
3
questions
~27k
people reached
  • London, United Kingdom
  • Member for 9 years, 1 month
  • 707 profile views
  • Last seen Sep 25 '17 at 7:36

Communities (6)

Top network posts

Top tags (55)

Score 133
Posts 16
Posts % 42
Score 79
Posts 9
Score 74
Posts 8
Score 45
Posts 6
Score 44
Posts 6
Score 35
Posts 3
View all tags →

Top posts (38) All Questions Answers | Votes Newest

28 Bounded-input bijections of infinite sequences Oct 10 '10
23 When does “X is NP-complete” imply “#X is #P-complete”? Jan 17 '13
17 Finding even cycle in directed graphs Nov 7 '13
16 Conjectures implying Four Color Theorem Mar 26 '11
15 Is NPI contained in P/poly? Dec 11 '12
14 Is Max-Cut APX-complete on triangle-free graphs? Oct 16 '11
12 Sampling satisfiable 3-SAT formulas Sep 4 '13
12 Proofs obtained only through spectral graph theory Feb 23 '11
12 What's the complexity of Median-SAT? Feb 16 '11
11 When is relaxed counting hard? Oct 10 '10
View all questions and answers →

Badges (43)

Gold

—

Silver

16

Rarest

Bronze

27

Rarest

View all badges →