scientific article; zbMATH DE number 3614177

MaRDI QIDQ4178491zbMATH OpenFDO

Authors R. G. Nigmatullin

Publication date 1978

zbMATH Keywords

Approximate AlgorithmsBoolean FunctionChromatic Theory of GraphsCircuitsComputational ComplexityDiscrete Extremal ProblemsHamiltonian Graphs

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Logical aspects of Boolean algebras (03G05) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Analysis of algorithms and problem complexity (68Q25)

Cited in

(1)

• Discrete extremal problems

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 Q4178491)