( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Non existence of some mixed Moore graphs of diameter 2 using SAT.

, , и . Discret. Math., 339 (2): 589-596 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Bárbara Fernández Fernández

Fernando Fernández

Victoria Fernández

Asunción Fernández

Pablo Fernández

 

Другие публикации лиц с тем же именем

Automated monitoring of medical protocols: a secure and distributed architecture., , , , и . Artif. Intell. Medicine, 27 (3): 367-392 (2003)Non existence of some mixed Moore graphs of diameter 2 using SAT., , и . Discret. Math., 339 (2): 589-596 (2016)The Impact of Balancing on Problem Hardness in a Highly Structured Domain., , , , и . AAAI, стр. 10-15. AAAI Press, (2006)On Balanced CSPs with High Treewidth., , , и . AAAI, стр. 161-166. AAAI Press, (2007)Modeling Choices in Quasigroup Completion: SAT vs. CSP., , , , и . AAAI, стр. 137-142. AAAI Press / The MIT Press, (2004)Minimal and Redundant SAT Encodings for the All-Interval-Series Problem., , , , и . CCIA, том 2504 из Lecture Notes in Computer Science, стр. 139-144. Springer, (2002)From High Girth Graphs to Hard Instances., , , и . CP, том 5202 из Lecture Notes in Computer Science, стр. 298-312. Springer, (2008)Statistical Regimes Across Constrainedness Regions., , , и . CP, том 3258 из Lecture Notes in Computer Science, стр. 32-46. Springer, (2004)Grid-based SensorDCSP., , , , , и . IJCAI, стр. 1359-1361. Morgan Kaufmann, (2003)Hard SAT and CSP instances with Expander Graphs., , , и . ISAIM, (2008)