Search results

Young P.R. [1969] Toward a theory of enumerations J. Ass. Comp. Mach. , 16, № 2, 328-348 70.01.66 O article Вернуться к поиску

Young P.R. [1964] A note on pseudo-creative sets and cylinders Pacif. J. Math., 14, № 2, 749-753 65.09.62 O article Вернуться к поиску

Young P.R. [1964] On reducibility by recursive functions Proc. Amer. Math. Soc., 15, № 6, 889-892 65.07.66 O article Вернуться к поиску

Young P.R. [1966] Linear orderings under one-one reducibility J. Symbolic Logic, 31, № 1, 70-85 68.07.65 ROS article Вернуться к поиску

Machtey M., Young P.R. [1978] An introduction to the general theory of algorithms Elsevier, North-Holland, Amsterdam, N.Y. ? S book Вернуться к поиску

Young P.R. [1983] Some structural properties of polynomial reducibilities and sets in NP Proc. Symp. Struct. Comput., 15, 392-401 ? O article Вернуться к поиску

Young P.R. [1965] On semi-cylinders, splinters and bounded truth-table reducibility Trans. Amer. Math. Soc., 115, № 3, 329-339 67.05.54 O article Вернуться к поиску

Mahaney S.R., Young P. R. [1985] Reductions among polynomial isomorphism types Theor. Comp. Sci., 39, № 2-3 207-224 86.Г12.29 O article Вернуться к поиску

Young P.R. [1968] An effective operator, continuous but not partial recursive Proc. Amer. Math. Soc., 19 , № 1, 103-108 68.09.64 O article Вернуться к поиску

Young P.R. [1966] A theorem on recursively enumerable classes and splinters Proc. Amer. Math. Soc., 17, № 5,1050-1056 67.06.55 EO article Вернуться к поиску

Young P.R. [1971] Speed-up by changing the order in which sets are enumerated Math. Syst. Theory, 5, № 2, 148-156 72.B2.729 O article Вернуться к поиску

Young P.R. [1971] A note on dense and non dense families of complexity classes Math. Syst. Theory, 5, № 1, 66-70 72.В2.729 O article Вернуться к поиску

Ritchie R.W., Young P. R. [1969] Strong representability of partial recursive functuons in arithmetic theories Information Sciences, 1 № 2, 189-204 69.12.201 article Вернуться к поиску

Machtey M., Winklmann K., Young P.R. [1978] Simple Gödel numberings, isomorphisms, and programming properties SIAM J. Comp., 7, № 1, 39-60 78.В11.1084 O article Вернуться к поиску

Helm J.P., Meyer A. R., Young P. R. [1973] On orders of translations and enumerations Pacif. J. Math., 46, № 1, 185-195 74.01.97 article Вернуться к поиску

Young P.R. [1973] Easy construction in complexity theory: gap and speed-up theorems Proc. Amer. Math. Soc., 37, № 2, 555-563 73.10.46 O article Вернуться к поиску

Young P.R. [1967] On pseudo-creative sets, splinters and bounded truth-table reducibility Z. math. Logik und Grundl. Math., 13, № 1, 25-31 67.11.71 O article Вернуться к поиску

Young P.R. [1971] A note on “axioms” for computational complexity and computations of finite functions Inform. and Control, 19, № 5,337-386 72.B5.502 O article Вернуться к поиску

Joseph D., Young P.R. [1985] Some remarks on witness functions for nonpolynominal and noncomplete set in NP>/i> Theor. Comput. Sci., 39, № 2-3, 225-237 86.Г5.416 O article Вернуться к поиску

Young P.R. [1985] Gödel theorems, exponential difficulty and undecidability of arithmetic theories an exposition Proc. AMS and ASL Summer Institute on Recursive Theory (Ithaca, New York), Lect. Notes in Math. 42, 503-522, Springer-Verlag 86.02.78 S article Вернуться ...

Y YaknisA YaknisV Yang Dong Ping Yang Yue Yasuhara A. Yates C.E.M. Yi Xiaoding Young P.R. YuLiang Yue Jang Yuefei Sui Вернуться на главную страницу