Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs

Author： Iwamoto Chuzo   Hatayama Naoki   Nakashiba Yoshiaki   Morita Kenichi   Imai Katsunobu  

Publisher： Springer Publishing Company

ISSN： 0001-5903

Source： Acta Informatica, Vol.44, Iss.5, 2007-09, pp. : 345-359

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On adaptive DLOGTIME and POLYLOGTIME reductions

By Alvarez C.   Jenner B.  

Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. : 183-205

Elsevier

Access to resources Recommend Favorite

ERCW PRAMs and optical communication

By MacKenzie P.D.   Ramachandran V.  

Theoretical Computer Science, Vol. 196, Iss. 1, 1998-04 ,pp. : 153-180

Elsevier

Access to resources Recommend Favorite

Time lower bounds do not exist for CRCW PRAMs

By Iwama K.   Iwamoto C.   Morshed M.  

Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. : 411-424

Elsevier

Access to resources Recommend Favorite

TMS for multimodal information processing

By Barricelli Barbara   Mussio Piero   Padula Marco   Scala Paolo  

Multimedia Tools and Applications, Vol. 54, Iss. 1, 2011-08 ,pp. : 97-120

Springer Publishing Company

Access to resources Recommend Favorite

Alternating and empty alternating auxiliary stack automata

By Holzer M.   McKenzie P.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 307-326

Elsevier

Access to resources Recommend Favorite