Complexity of algorithms and computations (Q1153141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5597532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Russian Language Ignored / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5594601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solvability of the Halting Problem for 2-State Post Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Dependence of Degrees of Difficulty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration and the Grzegorczyk Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration of Primitive Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the 3‐Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5562003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmkomplexität von berechenbaren Funktionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Effective Procedures for Speeding Up Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remarkable Class of Mannheim-Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity and the Existence of Complexity Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the speed of addition and multiplication on one-tape, off-line turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity problems in real time languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Primitive Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifications of Recursive Functions by Means of Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reduction of tape reversals for off-line one-tape Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with a schedule to keep / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Simulation of Multihead Tape Units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-restricted sequence generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted turing computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of One-Tape Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Undecidable Problems in Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5681534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape-reversal bounded Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of the Theory of Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two memory bounds for the recognition of primes by automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size vs. efficiency for programs admitting speed-ups / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-tape, off-line Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Turing Machine Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Tape Simulation of Multitape Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Hierarchy of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence of Different Hierarchies of Elementary Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Halting Problem of one State Turing Machines with <i>n</i>‐Dimensional Tape / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Between Time and Tape Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note Concerning Nondeterministic Tape Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on tape reversal complexity of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of an effectively generated class of functions by enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Properties of Abstract Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumerability and invariance of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of the Kolmogorov concept of complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of number-theoretic functions II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity oscillations in infinite binary sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of computable functions defined by bounds on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program size in restricted programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational speed-up by effective operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classification of the Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5552753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Efficiency of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Sets in Subrecursive Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Primitive Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape bounds for time-bounded Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zusammenhang der mehrfachen und transfiniten Rekursionen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die mehrfache Rekursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real time computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Predictably Computable Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of recursive functions based on Ackermann's function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Definable Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The state complexity of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to the definition of random sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Bemerkung zum Begriff der zuf�lligen Folge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Klassifikation der Zufallsgesetze nach Komplexit�t und Ordnung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rekursionszahlen und die Grzegorczyk-Hierarchie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines) / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Band-Simulation von k-Kopf-Turing-Maschinen. (k-tape simulation of k- head Turing machines) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line turing machine recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrecursiveness: Machine-independent notions of computability in restricted time and storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of the ordinal recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Time Required to Perform Addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Time Required to Perform Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on dense and nondense families of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The range of a vector measure with values in a montel space / rank
 
Normal rank

Revision as of 11:22, 13 June 2024

scientific article
Language Label Description Also known as
English
Complexity of algorithms and computations
scientific article

    Statements

    Complexity of algorithms and computations (English)
    0 references
    0 references
    0 references
    1981
    0 references
    analytic classification
    0 references
    Turing machine
    0 references
    Markov algorithm
    0 references
    real time computation
    0 references
    hierarchies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references