The rectangle complexity of functions on two-dimensional lattices

Author： Sander J.W.   Tijdeman R.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 857-863

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

The complexity of functions on lattices

By Sander  

Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. : 195-225

Elsevier

Access to resources Recommend Favorite

The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes

By Liskiewicz M.   Ogihara M.   Toda S.  

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 129-156

Elsevier

Access to resources Recommend Favorite

Method for splitting into physical processes in the problem on the time dynamics of electron wave functions of a two-dimensional quantum ring

By Bryzgalov A.   Karmanov F.  

Mathematical Models and Computer Simulations, Vol. 3, Iss. 1, 2011-02 ,pp. : 25-34

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Two-dimensional packing with conflicts

By Epstein Leah   Levin Asaf   Stee Rob  

Acta Informatica, Vol. 45, Iss. 3, 2008-05 ,pp. : 155-175

Springer Publishing Company

Access to resources Recommend Favorite

Two-Dimensional partitioning problems

By Middendorf M.  

Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. : 73-106

Elsevier

Access to resources Recommend Favorite