User:Michael Veksler

I am a graduate student at the Technion who has completed most of my M.Sc. requirements.

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)

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.