Abstract:
We define a language L and show that its time and space complexities T and S must satisfy T2S ≥ cn3 even allowing machines with multiple (non random) access to the input.Metadata
Abstract:
We define a language L and show that its time and space complexities T and S must satisfy T2S ≥ cn3 even allowing machines with multiple (non random) access to the input.
Date of Conference: 28-30 October 1981
Date Added to IEEE Xplore: 18 July 2008
Print ISSN: 0272-5428
