( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Sparse Hard Sets for Counting Classes.

, и . Theor. Comput. Sci., 112 (2): 255-275 (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.

Enrique Lozano

Enrique Lozano

Juan Lozano

Armand Lozano

Enrique Lozano

 

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

Fast calculation of entropy with Zhang's estimator., , , и . CoRR, (2017)Symmetry Breaking in Tournaments.. Electron. J. Comb., 20 (1): 69 (2013)Seeded Tree Alignment and Planar Tanglegram Layout., , , , и . WABI, том 4645 из Lecture Notes in Computer Science, стр. 98-110. Springer, (2007)On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms., и . FSTTCS, том 1530 из Lecture Notes in Computer Science, стр. 295-306. Springer, (1998)Trees whose even-degree vertices induce a path are antimagic., , , и . Discuss. Math. Graph Theory, 42 (3): 959-966 (2022)On the Non-Uniform Complexity of the Graph Isomorphism Problem., и . Complexity Theory: Current Research, стр. 245-271. Cambridge University Press, (1992)Mining Implications from Lattices of Closed Trees., , и . EGC, том RNTI-E-11 из Revue des Nouvelles Technologies de l'Information, стр. 373-384. Cépaduès-Éditions, (2008)On the Nonuniform Complexity on the Graph Isomorphism Problem., и . SCT, стр. 118-129. IEEE Computer Society, (1992)The Complexity of Modular Graph Automorphism., , и . STACS, том 1373 из Lecture Notes in Computer Science, стр. 172-182. Springer, (1998)Self-Reducible Sets of Small Sensity., и . Math. Syst. Theory, 24 (2): 83-100 (1991)