Theoretical Computer Science
Profile Activity
Meta user
Network profile
18,448
reputation
3
58
142

András Salamon

I'm a computer scientist, working on theoretical questions that are motivated by practical problems. My thesis was on tractable classes of constraint satisfaction problems, and I have also worked on containment of conjunctive database queries, the macroscope model of communication complexity, lower bounds for streaming, and bounds on parallelism.

113
answers
53
questions
~507k
people reached

Communities (11)

Top Meta Posts
8
24

Top network posts

Top tags (133)

Score 413
Posts 83
Posts % 50
Score 212
Posts 22
Score 140
Posts 24
Score 120
Posts 24
Score 115
Posts 19
Score 91
Posts 14
View all tags →

Top posts (166)

All Questions Answers
Votes Newest
145 Major unsolved problems in theoretical computer science? Aug 17 '10
54 Can one amplify P=NP beyond P=PH? Mar 13 '11
52 Dinner-table description of theoretical computer science? Sep 19 '10
50 Constraint satisfaction problem (CSP) vs. satisfiability modulo theory (SMT); with a coda on constraint programming Feb 9 '15
45 Generalized Ladner's Theorem Aug 31 '10
42 Rigour leading to insight Oct 12 '10
41 Major unsolved problems in theoretical computer science? Aug 23 '10
40 Does Rabin/Yao exist (at least in a form that can be cited)? Jan 3 '15
39 Is there a logic without induction that captures much of P? Sep 2 '10
36 NC = P consequences? Sep 24 '10
View all questions and answers →

Badges (203)

Gold

3

Rarest

Silver

58

Rarest

Bronze

142

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.