RELATIVIZED GENERIC CLASSES P AND NP

DOI10.17223/20710410/40/8zbMath1464.68120OpenAlexW2909024078WikidataQ128623740 ScholiaQ128623740MaRDI QIDQ5151221

Alexander N. Rybalov

Publication date: 17 February 2021

Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm622

zbMATH Keywords

oraclesgeneric complexityP vs NP problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other nonclassical models of computation (68Q09)

Related Items (1)

ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS

Cites Work

• Generic-case complexity, decision problems in group theory, and random walks.
• Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
• Unnamed Item
• Unnamed Item

This page was built for publication: RELATIVIZED GENERIC CLASSES P AND NP