Resultado da Busca
24 de mai. de 2024 · Juris Hartmanis: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA. ACM 1986 , ISBN 0-89791-193-8 [contents]
21 de mai. de 2024 · Juris Hartmanis: Structural Complexity Columns in Sparse complete sets for NP and the optimal collpase of the polynomial hierarchy. Bull. EATCS 32: 73-81 (1987)
7 de mai. de 2024 · Aims & Scope. The journal Asymptotic Analysis fulfills a twofold function. It aims at publishing original mathematical results in the asymptotic theory of problems affected by the presence of small or large parameters on the one hand, and at giving specific indications of their possible applications to different fields of natural sciences on ...
24 de mai. de 2024 · Juris Hartmanis, PhD 1955; recipient of the 1993 Turing Award; Chandrashekhar Khare, PhD 1995; David Kirk, PhD 1993; Donald Knuth, PhD 1963; creator of TeX typesetting language; author of The Art of Computer Programming; recipient of the 1974 Turing Award; Kyoto Prize laureate; Harvey Prize recipient; National Medal of Science recipient
Há 2 dias · Series Editors Gerhard Goos, Karlsruhe University, Germany Juris Hartmanis, Cornell University, NY, USA Jan van Leeuwen, Utrecht University, The Netherlands Author Josef Pauli Christian-Albrecht Universi¨at zu Kiel Institut f¨ur Informatik und Praktische Mathematik Preusserstr. 1-9, 24105 Kiel, Germany E-mail: [email protected] Cataloging-in ...
Há 1 dia · In this paper, we show that computing canonical labelings of graphs of bounded rank-width is in TC². Our approach builds on the framework of Köbler & Verbitsky (CSR 2008), who established the analogous result for graphs of bounded treewidth. Here, we use the framework of Grohe & Neuen (ACM Trans. Comput. Log., 2023) to enumerate separators ...
Há 4 dias · Juris Hartmanis, John E. Hopcroft: What makes Some Language Theory Problems Undecidable. 368-376
