The following pages link to László Babai (Q196035):
Displaying 50 items.
- Asymptotic Delsarte cliques in distance-regular graphs (Q295820) (← links)
- Most primitive groups are full automorphism groups of edge-transitive hypergraphs. (Q468722) (← links)
- On the automorphism groups of strongly regular graphs. II. (Q468725) (← links)
- (Q584261) (redirect page) (← links)
- A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality (Q584262) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- The cost of the missing bit: Communication complexity with help (Q700359) (← links)
- Connectivity of infinite graphs having a transitive torsion group action (Q754229) (← links)
- Lower bounds to the complexity of symmetric Boolean functions (Q914382) (← links)
- Small-diameter Cayley graphs for finite simple groups (Q914696) (← links)
- Finite groups of uniform logarithmic diameter. (Q995360) (← links)
- Sidon sets in groups and induced subgraphs of Cayley graphs (Q1063041) (← links)
- On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
- (Q1105689) (redirect page) (← links)
- On the diameter of Cayley graphs of the symmetric group (Q1105690) (← links)
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes (Q1106840) (← links)
- On the nonuniform Fisher inequality (Q1106859) (← links)
- A lower bound for read-once-only branching programs (Q1107323) (← links)
- Random oracles separate PSPACE from the polynomial-time hierarchy (Q1108794) (← links)
- On the limits of computations with the floor function (Q1112603) (← links)
- Tournaments with given regular group (Q1133556) (← links)
- On set intersections (Q1138551) (← links)
- Endomorphism monoids and topological subgraphs of graphs (Q1141150) (← links)
- Finite digraphs with given regular automorphism groups (Q1148328) (← links)
- On sharply edge-transitive permutation groups (Q1159687) (← links)
- (Q1160711) (redirect page) (← links)
- On the order of doubly transitive permutation groups (Q1160712) (← links)
- On the automorphism groups of almost all Cayley graphs (Q1163030) (← links)
- On the order of uniprimitive permutation groups (Q1164133) (← links)
- On the orders of primitive groups with restricted nonabelian composition factors (Q1168415) (← links)
- Graphs with given automorphism group and few edge orbits (Q1176027) (← links)
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems (Q1180551) (← links)
- On the diameter of permutation groups (Q1197618) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- Tibor Gallai, 1912-1992 (Q1204533) (← links)
- Addendum to: Non-deterministic exponential time has two-prower interactive protocols (Q1210334) (← links)
- Sense preserving groups of polyhedral graphs (Q1220084) (← links)
- Spectra of Cayley graphs (Q1230633) (← links)
- On the collineation groups of infinite projective and affine planes (Q1237947) (← links)
- Symmetry groups of vertex-transitive polytopes (Q1250110) (← links)
- Infinite digraphs with given regular automorphism groups (Q1251669) (← links)
- Infinite quasigroups with given regular automorphism groups (Q1252299) (← links)
- Vector representable matroids of given rank with given automorphism group (Q1252862) (← links)
- Tournaments with given (infinite) automorphism group (Q1252866) (← links)
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs (Q1321029) (← links)
- Permutation groups without exponentially many orbits on the power set (Q1323837) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Short presentations for finite groups (Q1365014) (← links)
- Groups without faithful transitive permutation representations of small degree (Q1369259) (← links)
