Complexity of algorithms and computations
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursively (computably) enumerable sets and degrees (03D25) Complexity of computation (including implicit computational complexity) (03D15) Algorithms in computer science (68W99)
Cites work
- scientific article; zbMATH DE number 3427323 (Why is no real title available?)
- scientific article; zbMATH DE number 3551851 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 3557225 (Why is no real title available?)
- scientific article; zbMATH DE number 3206307 (Why is no real title available?)
- scientific article; zbMATH DE number 3206308 (Why is no real title available?)
- scientific article; zbMATH DE number 3251431 (Why is no real title available?)
- scientific article; zbMATH DE number 3267347 (Why is no real title available?)
- scientific article; zbMATH DE number 3277536 (Why is no real title available?)
- scientific article; zbMATH DE number 3305022 (Why is no real title available?)
- scientific article; zbMATH DE number 3305096 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3307566 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3314333 (Why is no real title available?)
- scientific article; zbMATH DE number 3317760 (Why is no real title available?)
- scientific article; zbMATH DE number 3322464 (Why is no real title available?)
- scientific article; zbMATH DE number 3322505 (Why is no real title available?)
- scientific article; zbMATH DE number 3372020 (Why is no real title available?)
- scientific article; zbMATH DE number 3372021 (Why is no real title available?)
- scientific article; zbMATH DE number 3380605 (Why is no real title available?)
- scientific article; zbMATH DE number 3407148 (Why is no real title available?)
- scientific article; zbMATH DE number 3407149 (Why is no real title available?)
- scientific article; zbMATH DE number 3407150 (Why is no real title available?)
- scientific article; zbMATH DE number 3418624 (Why is no real title available?)
- scientific article; zbMATH DE number 3420721 (Why is no real title available?)
- 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
- A Classification of the Recursive Functions
- A Hierarchy of Primitive Recursive Functions
- A Machine-Independent Theory of the Complexity of Recursive Functions
- A New Hierarchy of Elementary Functions
- A Note Concerning Nondeterministic Tape Complexities
- A Remarkable Class of Mannheim-Curves
- A classification of the ordinal recursive functions
- A formal theory of inductive inference. Part I
- A note on dense and nondense families of complexity classes
- A unified approach to the definition of random sequences
- A variant of the Kolmogorov concept of complexity
- An Overview of the Theory of Computational Complexity
- Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
- Classes of Predictably Computable Functions
- Classes of computable functions defined by bounds on computation
- Classes of recursive functions based on Ackermann's function
- Classifications of Recursive Functions by Means of Hierarchies
- Complexity oscillations in infinite binary sequences
- Complexity problems in real time languages
- Computational Complexity and the Existence of Complexity Gaps
- Computational Complexity of One-Tape Turing Machine Computations
- Computational speed-up by effective operators
- Counter machines and counter languages
- Degrees of computational complexity
- Eine Bemerkung zum Begriff der zuf�lligen Folge
- Enumeration and the Grzegorczyk Hierarchy
- Extension of an effectively generated class of functions by enumeration
- Fast multiplication of large numbers
- Hierarchies of Primitive Recursive Functions
- Hierarchies of number-theoretic functions II
- Hierarchies of number-theoretic functions. I
- Iteration of Primitive Recursion
- Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung
- Machine Dependence of Degrees of Difficulty
- Note on tape reversal complexity of languages
- Note on the 3‐Recursive Functions
- On Effective Procedures for Speeding Up Algorithms
- On restricted turing computability
- On size vs. efficiency for programs admitting speed-ups
- On the Complexity of Undecidable Problems in Automata Theory
- On the Computational Complexity of Algorithms
- On the Efficiency of Algorithms
- On the Length of Programs for Computing Finite Binary Sequences
- On the Time Required to Perform Addition
- On the Time Required to Perform Multiplication
- On the size of machines
- On the speed of addition and multiplication on one-tape, off-line turing machines
- On-Line Turing Machine Computations
- On-line turing machine recognition
- One-tape, off-line Turing machine computations
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
- Program size in restricted programming languages
- Programmkomplexität von berechenbaren Funktionen
- Quasi-realtime languages
- Random Sets in Subrecursive Hierarchies
- Real time computation
- Real-Time Definable Languages
- Real-Time Simulation of Multihead Tape Units
- Real-time language recognition by one-dimensional cellular automata
- Recursive Properties of Abstract Complexity Classes
- Rekursionszahlen und die Grzegorczyk-Hierarchie
- Relations Between Time and Tape Complexities
- Relationships between nondeterministic and deterministic tape complexities
- Russian Language Ignored
- Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
- Some Results on Tape-Bounded Turing Machines
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- Tape bounds for time-bounded Turing machines
- Tape-reversal bounded Turing machine computations
- The Equivalence of Different Hierarchies of Elementary Functions
- The Halting Problem of one State Turing Machines with n‐Dimensional Tape
- The Solvability of the Halting Problem for 2-State Post Machines
- The complexity of theorem-proving procedures
- The definition of random sequences
- The enumerability and invariance of complexity classes
- The range of a vector measure with values in a montel space
- The reduction of tape reversals for off-line one-tape Turing machines
- The state complexity of Turing machines
- Theory of Formal Systems. (AM-47)
- Time-restricted sequence generation
- Turing machines with a schedule to keep
- Two memory bounds for the recognition of primes by automata
- Two-Tape Simulation of Multitape Turing Machines
- Weak Second‐Order Arithmetic and Finite Automata
- Zusammenhang der mehrfachen und transfiniten Rekursionen
- Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines)
- k-Band-Simulation von k-Kopf-Turing-Maschinen. (k-tape simulation of k- head Turing machines)
- Über die mehrfache Rekursion
This page was built for publication: Complexity of algorithms and computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153141)
