scientific article; zbMATH DE number 44418

zbMATH Open0705.68053MaRDI QIDQ3993545FDOQ3993545

Authors: Rüdiger Reischuk 

Publication date: 23 January 1993

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

Recommendations

• scientific article; zbMATH DE number 1216160
• scientific article; zbMATH DE number 578252
• scientific article; zbMATH DE number 610968

zbMATH Keywords

complexity theoryNP-completenesscircuitsTuring machinesparallel computersrandom access machinescomplete problemsprocessor networkstime versus place problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (10)

• Title not available (Why is that?)
• Linear speed-up does not hold on Turing machines with tree storages
• On computation with pulses
• Pattern matching in trace monoids (extended abstract)
• Title not available (Why is that?)
• The complexity theory companion
• Title not available (Why is that?)
• Foundations of \(r\)-contiguous matching in negative selection for anomaly detection
• Unambiguity of circuits
• Time-space tradeoffs for satisfiability

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