scientific article; zbMATH DE number 4021119

zbMATH Open0628.03026MaRDI QIDQ3764142FDOQ3764142

Authors: Thomas Gundermann, Gerd Wechsung 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Nondeterminism within $P^ * $
• scientific article; zbMATH DE number 176517
• scientific article; zbMATH DE number 3903969
• Improving the classification of complexities
• scientific article; zbMATH DE number 4045156

zbMATH Keywords

relativizationsBoolean closure of NPhierarchy classesnondeterministic polynomial time Turing machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cited In (6)

• Autoreducibility, mitoticity, and immunity
• Languages polylog-time reducible to dot-depth 1/2
• Machines that can output empty words
• ALTERNATING TURING MACHINES WITH MODIFIED ACCEPTING STRUCTURE
• The complexity of unions of disjoint sets
• Title not available (Why is that?)

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