( en | de | ru )

 

Disambiguation of "Luna, Guillermo De Ita"

Author of the publication

copydeleteadd this publication to your clipboard
Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT.

, , and . MCPR, volume 7914 of Lecture Notes in Computer Science, page 274-283. Springer, (2013)

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. You can also use the button next to the name to display some publications already assigned to the person.

Guillermo Luna Jorquera

José Guillermo De Aguinaga

Ita Osske

Yuki Itani-Adams

Ita Aisenstadt

 

Other publications of authors with the same name

A Novel Method for Counting Models on Grid Boolean Formulas., , and . MCPR, volume 6256 of Lecture Notes in Computer Science, page 322-331. Springer, (2010)Smart Tourism in 1-Click., , , and . FNC/MobiSPC, volume 56 of Procedia Computer Science, page 447-452. Elsevier, (2015)Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT., , and . MCPR, volume 7914 of Lecture Notes in Computer Science, page 274-283. Springer, (2013)A Note for Parametric Complexity of #2SAT., , and . LA-NMR, volume 804 of CEUR Workshop Proceedings, page 95-104. CEUR-WS.org, (2011)Efficient counting of models for boolean formulas represented by embedded cycles., , and . LA-NMR, volume 286 of CEUR Workshop Proceedings, CEUR-WS.org, (2007)Counting Falsifying Assignments of Conjunctive Forms Using Binary Patterns., , and . LANMR, volume 1287 of CEUR Workshop Proceedings, page 1-10. CEUR-WS.org, (2014)A Logical Database for Geriatric Purposes., , and . AMW, volume 1087 of CEUR Workshop Proceedings, CEUR-WS.org, (2013)A Multiagent System for Modeling Democratic Elections., , and . FLAIRS, AAAI Press, (2011)A Worst-Case Time Upper Bound for Counting the Number of Independent Sets., and . CAAN, volume 4852 of Lecture Notes in Computer Science, page 85-98. Springer, (2007)Modelling 3-Coloring of Polygonal Trees via Incremental Satisfiability., , and . MCPR, volume 10880 of Lecture Notes in Computer Science, page 93-102. Springer, (2018)