No coin nor oath required. For personal study only.
Theoretical Computer Science Master index volumes 171-180 (For the sake of simplicity and uniformity, all names beginning with articles or prepositions are listed as if written as single words) Ajili, F. and E. Contejean, Avoiding slack variables in the solving of linear diophantine equations and inequations 173 (1) (1997) 183-208 Alagit. M., see S. Alagic 179 (l-2) (1997) 273-299 Alagic. S. and M. AlagiC, Order-sorted model theory for temporal executable specifications 179 (l-2) (1997) 273-299 Ambos-Spies, K., S.A. Terwijn and X. Zheng, Resource bounded randomness and weakly complete problems 172 (l-2) (1997) 195-207 Anderson, S.O. and A.J. Power, A representable approach to finite nondeterminism 177 (1) (1997) 3325 Andreev, A.E., A.E.F. Clementi and J.D.P. Rolim, Optimal bounds for the approximation of boolean functions and some applications 180 (l-2) (1997) 243-268 Apolloni, B. and S. Chiaravalli, PAC learning of concept classes through the boundaries of their items 172 (l-2) (1997) 91-120 Arora, S. and R. Fagin, On winning strategies in Ehrenfeucht-Frdisst games 174 (l-2) (1997) 97~-121 Arvind, V. and N.V. Vinodchandran, Solvable black-box group problems are low for PP 180 (I-2) (1997) 17-45 Astesiano, E., Preface 173 (2) (1997) 309 Atkinson, M.D., M.J. Livesey and D. Tulley, Permutations generated by token passing in graphs 178 (l-2) (1997) 103-118 Ausiello, G. and R. Giaccio, On-line algorithms for satisfiability problems with uncertainty 171 (I -2) (1997) 3-24
📜 SIMILAR VOLUMES