scientific article; zbMATH DE number 3761403

MaRDI QIDQ3944006zbMATH OpenFDO

Authors A. O. Slisenko

Publication date 1981

zbMATH Keywords

surveycomplexity classescomputation theorystring matchingeffective algorithmsgraph problemssolution of equationscompleteness problemsgeometrical problemscomplexity hierarchiesarithmetical operationsproblems with at least exponential lower complexity boundproblems with nontrivial lower complexity bound

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
• Linear codes and modular curves
• Complexity of computations in Commutative Division of the USSR Academy of Sciences
• Algorithms constructing a representive vector criterion for a binary preference relation

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