Complete and incomplete Boolean degrees

By Marchenkov S.  

Problems of Information Transmission, Vol. 46, Iss. 4, 2010-12 ,pp. : 346-352

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m

By Manzini G.   Margara L.  

Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. : 157-177

Elsevier

Access to resources Recommend Favorite

Topological model and analysis of the P2P BitTorrent protocol

By Zhong Ling  

International Journal of System Control and Information Processing, Vol. 1, Iss. 1, 2012-11 ,pp. : 54-70

Inderscience Publishers

Access to resources Recommend Favorite

Computational power of insertion-deletion (P) systems with rules of size two

By Krassovitskiy Alexander  

Natural Computing, Vol. 10, Iss. 2, 2011-06 ,pp. : 835-852

Springer Publishing Company

Access to resources Recommend Favorite

Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)

By Anter Amir  

Natural Computing, Vol. 9, Iss. 4, 2010-12 ,pp. : 891-902

Springer Publishing Company

Access to resources Recommend Favorite