The following pages link to Cèsar Fernández (Q505969):
Displaying 17 items.
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- Non existence of some mixed Moore graphs of diameter 2 using SAT (Q898115) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Weighted argumentation for analysis of discussions in Twitter (Q2409095) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- (Q2741541) (← links)
- (Q3686019) (← links)
- (Q3776640) (← links)
- (Q3783590) (← links)
- (Q4040147) (← links)
- (Q4438827) (← links)
- (Q4475627) (← links)
- Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers (Q4589085) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900283) (← links)
