PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Torán, Jacobo"

Author of the publication

copydeleteadd this publication to your clipboard
The Graph Isomorphism Problem: Its Structural Complexity

, , and . Progress in Theoretical Computer Science Birkhäuser/Springer, (1993)

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.

No persons found for author name Torán, Jacobo
add a person with the name Torán, Jacobo
 

Other publications of authors with the same name

On the Hardness of Graph Isomorphism.. SIAM J. Comput., 33 (5): 1093-1108 (2004)On Finding the Number of Graph Automorphisms., , , and . Chicago J. Theor. Comput. Sci., (1999)The Complexity of Planar Graph Isomorphism., and . Bulletin of the EATCS, (2009)Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems., , , , , and . Theor. Comput. Sci., 181 (2): 267-287 (1997)Succinct Encodings of Graph Isomorphism., , and . LATA, volume 8370 of Lecture Notes in Computer Science, page 285-296. Springer, (2014)On the Resolution Complexity of Graph Non-isomorphism.. SAT, volume 7962 of Lecture Notes in Computer Science, page 52-66. Springer, (2013)Solution-Graphs of Boolean Formulas and Isomorphism., and . SAT, volume 9710 of Lecture Notes in Computer Science, page 29-44. Springer, (2016)Complexity Classes with Complete Problems Between P and NP-C., , and . FCT, volume 380 of Lecture Notes in Computer Science, page 13-24. Springer, (1989)On Counting and Approximation., , and . CAAP, volume 299 of Lecture Notes in Computer Science, page 40-51. Springer, (1988)Nondeterministic Instance Complexity and Hard-to-Prove Tautologies., , , and . STACS, volume 1770 of Lecture Notes in Computer Science, page 314-323. Springer, (2000)