scientific article; zbMATH DE number 3614177

zbMATH Open0395.68045MaRDI QIDQ4178491FDOQ4178491

Authors: R. G. Nigmatullin 

Publication date: 1978

Title of this publication is not available (Why is that?)

zbMATH Keywords

CircuitsBoolean FunctionComputational ComplexityHamiltonian GraphsApproximate AlgorithmsChromatic Theory of GraphsDiscrete Extremal Problems

Mathematics Subject Classification ID

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

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)