scientific article; zbMATH DE number 512806

zbMath0797.68077MaRDI QIDQ4281499

Antoni Lozano, Jacobo Toran

Publication date: 7 April 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sparse setsnonuniform complexitycomplexity classesgraph isomorphismgraph automorphismpolynomial-time reducibilitiestruth-table reducible

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

The complexity of generating test instances ⋮ A language-dependent cryptographic primitive ⋮ On the asymmetric complexity of the group-intersection problem ⋮ On the reducibility of sets inside NP to sets with low information content ⋮ Graph Isomorphism is in SPP

This page was built for publication: