Circuit and Decision Tree Complexity of Some Number Theoretic Problems

Author： Bernasconi A.   Damm C.   Shparlinski I.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.168, Iss.2, 2001-08, pp. : 113-124

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

Abstract

Related content

Parameterized complexity of basic decision problems for tree automata

By Charatonik Witold  

International Journal of Computer Mathematics, Vol. 90, Iss. 6, 2013-06 ,pp. : 1150-1170

Taylor & Francis Ltd

Access to resources Recommend Favorite

Decision problems for some classes of integer partitions and number multisets

By Shlyk V.  

Journal of Mathematical Sciences, Vol. 174, Iss. 1, 2011-04 ,pp. : 90-96

Springer Publishing Company

Access to resources Recommend Favorite

On some number-theoretic conjectures of V. Arnold

By Vinberg E.  

Japanese Journal of Mathematics, Vol. 2, Iss. 2, 2007-09 ,pp. : 297-302

Springer Publishing Company

Access to resources Recommend Favorite

On the complexity of some data analysis problems

By Kel'manov A.  

Computational Mathematics and Mathematical Physics, Vol. 50, Iss. 11, 2010-11 ,pp. : 1941-1947

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the complexity of some problems related to graph extensions

By Abrosimov M.  

Academy of Sciences of the USSR Mathematical Notes, Vol. 88, Iss. 5-6, 2010-12 ,pp. : 619-625

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite