( en | de | ru )

 

Disambiguation of "Manyà, Felip"

Author of the publication

copydeleteadd this publication to your clipboard
The Interface between P and NP in Signed CNF Formulas.

, , , and . ISMVL, page 251-256. IEEE Computer Society, (2004)

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.

Manya Brunzema

Sônia Felipe

Manya Brunzema

Aron Manyak

Esther Ndjeka Manya

 

Other publications of authors with the same name

Solving Combinatorial Problems with Regular Local Search Algorithms., and . LPAR, volume 1705 of Lecture Notes in Computer Science, page 33-43. Springer, (1999)Capturing Structure with Satisfiability., , , , and . CP, volume 2239 of Lecture Notes in Computer Science, page 137-152. Springer, (2001)Experimenting with the Instances of the MaxSAT Evaluation., , , and . CCIA, volume 232 of Frontiers in Artificial Intelligence and Applications, page 31-40. IOS Press, (2011)A Preprocessor for Max-SAT Solvers., , and . SAT, volume 4996 of Lecture Notes in Computer Science, page 15-20. Springer, (2008)Improved Exact Solvers for Weighted Max-SAT., , and . SAT, volume 3569 of Lecture Notes in Computer Science, page 371-377. Springer, (2005)An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers., , , , and . IJCAI, page 703-711. ijcai.org, (2017)Extending the Reach of SAT with Many-Valued Logics., , , , and . Electron. Notes Discret. Math., (2001)White Paper on Artificial Intelligence, Robotics and Data Science, , , , , , , , , and 1 other author(s). (2021)A Tableau Calculus for Signed Maximum Satisfiability., , , , and . ISMVL, page 170-175. IEEE, (2023)A Complete Tableau Calculus for the Regular MaxSAT Problem., , , and . CCIA, volume 375 of Frontiers in Artificial Intelligence and Applications, page 359-368. IOS Press, (2023)