I am a graduate student at the Technion who has completed most of my M.Sc. requirements.
As far as Wikipedia goes, I am interested in contributing to entries related to:
- Constraint satisfaction problem (CSP)
- Boolean satisfiability problem (SAT)
- Uses of SAT, such as formal verification
- Uses of CSP
- CSP propagation algorithms, such as:
- alldifferent as mentioned in Hyper-arc consistency. This includes the relevant parts in Graph theory used for its implementation.
- selection constraints as implemented in Minion_(solver)