Speed-Ups by changing the order in which sets are enumerated

DOI10.1007/BF01702871zbMath0218.68004MaRDI QIDQ5623225

No author found.

Publication date: 1971

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Splitting theorems for speed-up related to order of enumeration ⋮ Infimums of step-counting functions of enumeration of sets ⋮ The complexity of total order structures ⋮ Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems ⋮ Corrigendum: Speed-ups by changing the order in which sets are enumerated

Cites Work

• Unnamed Item
• Classes of computable functions defined by bounds on computation
• Speed-ups by changing the order in which sets are enumerated (Preliminary Version)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• On the size of machines
• Toward a Theory of Enumerations
• A Dichotomy of the Recursively Enumerable Sets
• The Operator Gap

This page was built for publication: Speed-Ups by changing the order in which sets are enumerated