Add to ORKGNon UBCUnreviewedAuthor affiliation: University of Illinois (Urbana-Champaign)Facult
We consider the relative complexities of a large number of computational geometry problems whose co...
We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manif...
On the complexity of the subspaces of Sω.Uzcátegui Aylwin, Carlos Enrique14 págs.uzca@ula.ve, slalm9...
Non UBCUnreviewedAuthor affiliation: University of Illinois (Urbana-Champaign)Facult
We investigate the computational complexity of some problems in three-dimensional topology ...
This survey focuses on the computational complexity of some of the fundamental decision problems in ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...
It is my strong believe that a deep study of the questions of what can and cannot be efficiently com...
Computational Complexity of Uncapacitated Multi-Echelon Production Plannin Problem
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the publ...
We give a summary of known results on Matveev’s complexity of compact 3-manifolds. The only rele...
Non UBCUnreviewedAuthor affiliation: Università degli Studi di Roma La SapienzaFacult
We consider the relative complexities of a large number of computational geometry problems whose co...
We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manif...
On the complexity of the subspaces of Sω.Uzcátegui Aylwin, Carlos Enrique14 págs.uzca@ula.ve, slalm9...
Non UBCUnreviewedAuthor affiliation: University of Illinois (Urbana-Champaign)Facult
We investigate the computational complexity of some problems in three-dimensional topology ...
This survey focuses on the computational complexity of some of the fundamental decision problems in ...
SIGLEAvailable from British Library Document Supply Centre- DSC:D42000/82 / BLDSC - British Library ...
It is my strong believe that a deep study of the questions of what can and cannot be efficiently com...
Computational Complexity of Uncapacitated Multi-Echelon Production Plannin Problem
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the publ...
We give a summary of known results on Matveev’s complexity of compact 3-manifolds. The only rele...
Non UBCUnreviewedAuthor affiliation: Università degli Studi di Roma La SapienzaFacult
We consider the relative complexities of a large number of computational geometry problems whose co...
We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manif...
On the complexity of the subspaces of Sω.Uzcátegui Aylwin, Carlos Enrique14 págs.uzca@ula.ve, slalm9...