Katalog der Deutschen Nationalbibliothek

Ergebnis der Suche nach: "115476032"
im Bestand: Gesamter Bestand

211 - 220 von 224

	211	On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes Karpiński, Marek. - Bonn : Inst. für Informatik, 1986, Rev. version
	212	On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes Karpiński, Marek. - Bonn : Inst. für Informatik, 1986
	213	The matching problem for bipartite graphs with polynomially bounded permanents is in NC Grigoriev, Dima. - Bonn : Inst. für Informatik, 1986
	214	The matching problem for strongly chordal graphs is in NC Dahlhaus, Elias. - Bonn : Inst. für Informatik, 1986
	215	Probabilistic NC1-circuits [NC-circuits] equal probabilistic polynomial time Karpiński, Marek. - Dortmund : Abt. Informatik, Univ., 1985
	216	Probabilistic NC1-circuits [NC-one-circuits] equal probabilistic polynomial time Karpiński, Marek. - Bonn : Inst. für Informatik, [1985 ?]
	217	Topics in the theory of computation Amsterdam : North-Holland, 1985
	218	On the power of two way random generators and the impossibility of deterministic poly-space simulation Karpiński, Marek. - Dortmund : Fachbereich Informatik d. Univ., 1984
	219	On the power of two way random generators and the impossibility of deterministic polyspace simulation Karpiński, Marek. - Bonn : Inst. für Informatik, [1984]
	220	Restricted principles of computing processes (PCP) and equations in free semigroups St. Augustin : Ges. für Mathematik u. Datenverarbeitung, 1981