Complexity of nonuniform computations for certain discrete problems

MaRDI QIDQ804293zbMATH OpenFDO

Authors A. A. Setin

Publication date 1989

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

complexity of non-uniform computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Review text

See the review in Zbl 0679.68093.

Cited in

(6)

• Nonuniform reductions and NP-completeness
• scientific article; zbMATH DE number 5971212 (Why is no real title available?)
• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• On the Complexity of Computing Two Nonlinearity Measures
• On the upper bounds for complexities of discrete functions
• Speedup for natural problems and noncomputability

This page was built for publication: Complexity of nonuniform computations for certain discrete problems

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