( en | de | ru )

 

Disambiguation of "Torán, Jacobo"

Author of the publication

copydeleteadd this publication to your clipboard
CNF and DNF succinct graph encodings.

, , and . Inf. Comput., (2017)

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.

Jacobo Weinstock

Jakob Toräng

Jacobo Martínez Font

Jacobo Jack Duek

Jacobo Manuel Maldonado Hünig

 

Other publications of authors with the same name

Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs., , and . STACS, volume 5 of LIPIcs, page 227-238. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)On the Non-Uniform Complexity of the Graph Isomorphism Problem., and . Complexity Theory: Current Research, page 245-271. Cambridge University Press, (1992)Space and Width in Propositional Resolution (Column: Computational Complexity).. Bulletin of the EATCS, (2004)CNF and DNF succinct graph encodings., , and . Inf. Comput., (2017)Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391)., , , and . Dagstuhl Reports, 8 (9): 133-153 (2018)A Combinatorial Technique for Separating Counting Complexity Classes.. ICALP, volume 372 of Lecture Notes in Computer Science, page 733-744. Springer, (1989)Number of Variables for Graph Identification and the Resolution of GI Formulas., and . Electron. Colloquium Comput. Complex., (2021)Graph Isomorphism is not AC^0 reducible to Group Isomorphism., , and . Electron. Colloquium Comput. Complex., (2010)Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs., , and . Electron. Colloquium Comput. Complex., (2009)Complexity Classes Defined by Counting Quantifiers.. J. ACM, 38 (3): 753-774 (1991)