scientific article
From MaRDI portal
Publication:3855156
zbMath0422.03013MaRDI QIDQ3855156
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P-selective setsNP-complete setspositive reductionspolynomial time reducibilities on NPpolynomial-time computable selector functiontally languages
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
This page was built for publication:
