A natural encoding scheme proved probabilistic polynomial complete

DOI10.1016/0304-3975(83)90004-XMaRDI QIDQ593778zbMATH OpenOpenAlexFDO

Authors Umesh V. Vazirani, Vijay V. Vazirani

Publication date 1983

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(83)90004-x

zbMATH Keywords

Kolmogorov complexityprobabilistic Turing machinesencoding schemesPR-completenessprobabilistic polynomial completeunfaithful random completeUR-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3489016 (Why is no real title available?)
• scientific article; zbMATH DE number 3557236 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the Structure of Polynomial Time Reducibility
• On the complexity of minimum inference of regular sets

Cited in

(5)

• On polynomial-time Turing and many-one completeness in PSPACE
• On random reductions from sparse sets to tally sets
• NP is as easy as detecting unique solutions
• On the power of generalized Mod-classes
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

This page was built for publication: A natural encoding scheme proved probabilistic polynomial complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q593778)