Simplifying the weft hierarchy

Autor: Buss, Jonathan F. ^*, Islam, Tarique

Publikováno v: In Theoretical Computer Science 2006 351(3):303-313

The Computational Complexity of Some Problems of Linear Algebra

Autor: Buss, Jonathan F ^{††Supported in part by grants from the Natural Sciences and Engineering Research Council (NSERC) of Canada and by the Information Technology Research Centre (ITRC) of Ontario.}, Frandsen, Gudmund S ^{‡‡Supported by the ESPRIT Long Term Research Programme of the EU, under Project 20244 (ALCOM-IT), and by Basic Research in Computer Science (BRICS), Centre of the Danish National Research Foundation.}, Shallit, Jeffrey O ^†

Publikováno v: In Journal of Computer and System Sciences June 1999 58(3):572-596

The computational complexity of some problems of linear algebra

Autor: Buss, Jonathan F., Frandsen, Gudmund Skovbjerg, Shallit, Jeffrey O.

Publikováno v: Buss, J F, Frandsen, G S & Shallit, J O 1997, The computational complexity of some problems of linear algebra . in R Reischuk & M Morvan (eds), STACS 97 : 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings . Springer, Lecture Notes in Computer Science, vol. 1200, pp. 451-462, 14th Annual Symposium on Theoretical Aspects of Computer Science. STACS 1997, Lübeck, Germany, 27/02/1997 . https://doi.org/10.1007/BFb0023480

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pure_au_____::60f1b8493291210401eb74d92ce86558
https://pure.au.dk/portal/da/publications/the-computational-complexity-of-some-problems-of-linear-algebra(3fdbc481-9774-4da1-a2d2-671bb3799021).html

Palindrome recognition using a multidimensional tape

Autor: Biedl, Therese, Buss, Jonathan F., Demaine, Erik D., Demaine, Martin L., Hajiaghayi, Mohammadtaghi, Vinař, Tomáš

Publikováno v: In Theoretical Computer Science 2003 302(1):475-480

On the pagenumber of planar graphs.

Autor: Buss, Jonathan F., Shor, Peter W.

Publikováno v: Proceedings of the Sixteenth Annual ACM Symposium: Theory of Computing; 12/ 1/1984, p98-100, 3p