scientific article; zbMATH DE number 1534573
From MaRDI portal
Publication:4517359
zbMATH Open0952.03049MaRDI QIDQ4517359FDOQ4517359
Authors: E. I. Latkin 
Publication date: 21 November 2000
Title of this publication is not available (Why is that?)
Recommendations
- The complexity of pseudo-linear functions
- LIMITING POLYNOMIAL APPROXIMATION OF COMPLEXITY CLASSES
- scientific article; zbMATH DE number 4057841
- A functional equation often arising in the analysis of algorithms (extended abstract)
- Algorithms and complexity for functions on general domains
- Lower bounds for the complexity of linear functionals in the randomized setting
- scientific article; zbMATH DE number 4134023
- Linear programming, complexity theory and elementary functional analysis
- On the Computational Complexity of Positive Linear Functionals on $$\mathcal{C}[0;1]$$
- Mathematical Foundations of Computer Science 2004
Cited In (6)
- Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP
- Structures computable in polynomial time. I
- Polynomially bounded sequences and polynomial sequences
- Straight-line program length as a parameter for complexity measures
- Existence and uniqueness of structures computable in polynomial time
- Complexity classification method for algorithms based on angular measure of functions' asymptotic increase
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 Q4517359)
