scientific article
From MaRDI portal
Publication:3742715
zbMATH Open0605.68032MaRDI QIDQ3742715
Publication date: 1985
Title of this publication is not available (Why is that?)
surveyoracle Turing machinecombination of time and space complexity in languagesNP-completeness, relativizationrefinement of indeterminism
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (12)
A comment on \('NP=P?'\) and restricted partitions ⋮ Title not available (Why is that?) ⋮ What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract) ⋮ On the Effective Enumerability of NP Problems ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ The Robbins problem: computer proofs and human proofs ⋮ Beyond NP ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Discussing the ``big \(n\) problem
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 Q3742715)
