Reputation
1,122
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
6 25
Newest
 Taxonomist
Impact
~20k people reached

Jun
22
asked Homomorphism for a fixed graph NP-complete?
Jun
9
accepted Constraint satisfaction problem - Arc consistency
Jun
9
answered Constraint satisfaction problem - Arc consistency
Jun
9
comment Constraint satisfaction problem - Arc consistency
Thats correct this is what makes it arc-inconsitent.
Jun
6
asked Constraint satisfaction problem - Arc consistency
May
10
asked Homomorphical Equivalence is NP-complete
May
5
accepted Infinite Chomp is a finite game?
May
5
comment Infinite Chomp is a finite game?
Thanks. That narrows it down to problem I have. There are infinite proper subsets of $\omega$ right (e.g. $\omega \setminus \{1\})$? Isn't it possible for example to choose a bite of $(1\times1)$ still resulting in a infinite choclate bar of size $\omega-1 \times \omega-1$?
May
5
asked Infinite Chomp is a finite game?
Mar
18
accepted Non-isomorphic structures with equal cardinality
Mar
18
asked Non-isomorphic structures with equal cardinality
Mar
8
accepted Different formulation of a Traveling Salesman Problem
Mar
8
asked Different formulation of a Traveling Salesman Problem
Feb
4
accepted Warehouse Location Problem as an integer progam instead of a mixed-integer program
Feb
3
revised Warehouse Location Problem as an integer progam instead of a mixed-integer program
spelling
Feb
3
asked Warehouse Location Problem as an integer progam instead of a mixed-integer program
Feb
3
awarded  Civic Duty
Jan
20
revised First Order logic with vertex covers
defining vertex cover. correcting syntax of binary relations.
Jan
20
suggested approved edit on First Order logic with vertex covers
Jan
20
comment First Order logic with vertex covers
Try using Ehrenfeucht–Fraïssé game. I'm trying to figure it out, too.