scientific article; zbMATH DE number 1332674

DOI10.4086/CJTCS.1999.001MaRDI QIDQ4259996zbMATH OpenOpenAlexFDO

Authors Robert Beals, Richard Chang, William Gasarch, Jacobo Torán

Publication date 8 September 1999

Published in Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4086/cjtcs.1999.001

zbMATH Keywords

computational complexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Computational complexity of graphs
• A note on decision versus search for graph automorphism
• scientific article; zbMATH DE number 512806

Cited in

(6)

• Some connections between bounded query classes and non-uniform complexity.
• On the reducibility of sets inside NP to sets with low information content
• Influence of the structure of a graph on its automorphisms
• Computing graph automorphism from partial solutions
• The enumerability of P collapses P to NC
• A combinatorial matrix approach for the generation of vacuum Feynman graphs multiplicities in ^4 theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4259996)