Complexity of nonuniform computations for certain discrete problems

zbMATH Open0727.68048MaRDI QIDQ804293FDOQ804293

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)

Cited In (6)

• THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
• On the upper bounds for complexities of discrete functions
• Speedup for natural problems and noncomputability
• Title not available (Why is that?)
• On the Complexity of Computing Two Nonlinearity Measures
• Nonuniform reductions and NP-completeness

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)