Abstract
The notion of a robust oracle machine and an oracle set "helping" a robust oracle machine has been introduced for better understanding the nondeterministic "witness searching" process in NP problems. It is shown that straightforward modifications of the original notion are closely related with other concepts in structural complexity theory, such as "self-reducibility", "lowness", and "interactive proof systems".
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
