Theory and practice of combinatorics turgeon j rosa a sabidussi g
Rating:
8,2/10
194
reviews

A polynomial-time theory of black box groups I. Asymmetric trees with two prescribed degrees. On the diameter of random Cayley graphs of the symmetric group. LĂĄszlĂł Babai and Igor Gorodezky. LĂĄszlĂł Babai, PĂ©ter Hajnal, Endre SzemerĂ©di, and GyĂ¶rgy TurĂĄn.

Automorphism groups of planar graphs I. On a conjecture of M. Annals of Mathematics, 113:553-568, 1981. Thesis, Hungarian Academy of Sciences. Tournaments with given infinite automorphism group. Sidon sets in groups and induced subgraphs of Cayley graphs.

On the number of -regular elements in finite simple groups. LĂĄszlĂł Babai and Thomas Hayes. Chromatic number and subgraphs of Cayley graphs. LĂĄszlĂł Babai, Robert Beals, and Ăkos Seress. Our study demonstrates that Cayley hash functions deserve further interest by the cryptography community. Graphs and Combinatorics, 1:23-28, 1985. Randomization in group algorithms: Conceptual questions.

LĂĄszlĂł Babai and Igor Pak. These problems arise naturally when describing the security of Cayley hash functions, a class of cryptographic hash functions with very interesting properties. Transparent proofs and limits to approximation. Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science. LĂĄszlĂł Babai, PĂ©ter Frankl, JĂĄnos KollĂĄr, and Gert Sabidussi. Isomorphism of hypergraphs of low rank in moderately exponential time.

Nondeterministic exponential time has two-prover interactive protocols. Die Paginierung obiger Ausgabe wird in dieser Neuausgabe als Marginalie zeilengenau mitgefĂŒhrt. LĂĄszlĂł Babai and Endre SzemerĂ©di. LĂĄszlĂł Babai, Haluk Oral, and Kevin T. Bolyai Mathematical Society, Budapest, 1996.

Ins Deutsche ĂŒbertragen von Adolf Lasson, Jena: Eugen Diederichs, 1907. Combinatorics, Probability, and Computing, 1:201-208, 1992. On the complexity of matrix group problems I. LĂĄszlĂł Babai and GyĂ¶rgy TurĂĄn. Bolyai Society - North-Holland, 1978.

Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes. LĂĄszlĂł Babai and Shlomo Moran. The problem has been solved for a few particular generator sets, but essentially nothing is known for generic generator sets. The complexity of defining a relation on a finite graph. Full version of item 1990.

LĂĄszlĂł Babai, Peter Kimmel, and Satyanarayana V. The security of many cryptographic protocols relies on the hardness of some computational problems. On graphs which contain all sparse graphs; Chapter 5. LĂĄszlĂł Babai and Peter J. Detail aus dem Fresko Die Schule von Athen von Raffael 1510â1511. Dedicated to Bob Guralnick in honor of his 60th birthday 1. LĂĄszlĂł Babai and Ăkos Seress.

Endomorphism monoids and topological subgraphs of graphs. Spectral extrema for graphs: the Zarankiewicz problem. CsĂĄszĂĄr, editor, Topics in Topology, Proc. Hungarian translation of parts of item 1996. Paul Erdos and his influence on the theory of computing.