András Salamon

258

Reputation

176 views

Registered User

Name	András Salamon
Member for	2 months
Seen	12 hours ago
Website	constraints.wordpress.com
Location	Edinburgh, UK
Age

Graduate student in computer science, working on the computational complexity of constraint satisfaction problems.

stats recent reputation favorites

1

Questions

3

5

votes

2

answers

530

views

Is k-XORSAT #P-complete?

cs.cc.complexity-theory

aug 16 at 7:23 Andrea Montanari 11●1

9

Answers

votes newest views recent

Fast Matrix Multiplication

when is the independence number of a graph equals the clique cover number

Cliquewidth of Cographs + kv

Succinctly naming big numbers: ZFC versus Busy-Beaver

What are the most attractive Turing undecidable problems in mathematics?

Software for Tree-Decompositions

Selecting k sub-posets

Where is it shown how to construct a decomposition tree for a series-parallel graph in linear time?

Ramsey pairs of classes graphs

517

Votes

511

6

13

Tags

graph-theory× 6
cs.cc.complexity-theory× 3
set-theory× 2
lo.logic× 2
computability-theory× 2
algorithms× 2
ramsey-theory
posets
linear-algebra
examples

computer-science
co.combinatorics
big-list

9

Badges

● Scholar
● Student

● Enthusiast
● Civic Duty

● Critic
● Commentator

● Editor
● Supporter