{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:24:44Z","timestamp":1648653884364},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1007\/bf00288774","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T15:51:37Z","timestamp":1096905097000},"page":"379-395","source":"Crossref","is-referenced-by-count":2,"title":["Complete problems for space bounded subclasses of NP"],"prefix":"10.1007","volume":"22","author":[{"given":"Moon Jung","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. Michael","family":"Evangelist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Some Additional Examples of Bandwidth Constrained NP-Complete Problems","author":"M.J. Chung","year":"1981","unstructured":"Chung, M.J., Evangelist, W.M., Sudborough, I.H.: Some Additional Examples of Bandwidth Constrained NP-Complete Problems. Proceedings 15th Conference on Information Sciences and Systems. Baltimore, Md: Johns Hopkins University Press 1981"},{"key":"CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman 1979"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","volume":"34","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity Results for Bandwidth Minimization. SIAM J. Appl. Math. 34, 477?495 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some Simplified NP-Complete Graph Problems. Theor. Comput. Sci. 1, 237?267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The Planar Hamiltonian Circuit Problem is NP-Complete. SIAM J. Computing 5, 704?714 (1976)","journal-title":"SIAM J. Computing"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E.M. Gurari","year":"1984","unstructured":"Gurari, E.M., Sudborough, I.H.: Improved Dynamic Programming Algorithms for Bandwidth Minimization and the Min-Cut Linear Arrangement Problem. J. Algorithms 5, 531?546 (1984)","journal-title":"J. Algorithms"},{"key":"CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Reading, Mass: Addison-Wesley 1979"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N.D. Jones","year":"1975","unstructured":"Jones, N.D.: Space Bounded Reducibility Among Combinatorial Problems. J. Comput. Syst. Sci. 11, 62?85 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Monien, B., Sudborough, I.H.: Bandwidth Constrained NP-Complete Problems. Proc. ACM Theory of Computing Symp. pp. 207?217 1981 (To appear in Theor. Comput. Sci.)","DOI":"10.1145\/800076.802474"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(82)90075-5","volume":"21","author":"B. Monien","year":"1982","unstructured":"Monien, B., Sudborough, I.H.: On eliminating nondeterminism from Turing machines that use less than logarithm worktape space. Theor. Comput. Sci. 21, 237?253 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02280884","volume":"16","author":"C.H. Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-Completeness of the Bandwidth Minimization Problem. Computing 16, 237?267 (1976)","journal-title":"Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02259908","volume":"31","author":"A. Rosenberg","year":"1983","unstructured":"Rosenberg, A., Sudborough, I.H.: Bandwidth and Pebbling. Computing 31, 115?139 (1983)","journal-title":"Computing"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between Nondeterministic and Deterministic Tape Complexities. J. Comput. Syst. Sci. 4, 177?192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"CR14","first-page":"216","volume-title":"The Complexity of Satisfiability Problems","author":"T.J. Schaefer","year":"1978","unstructured":"Schaefer, T.J.: The Complexity of Satisfiability Problems. Proc. 10th Annual ACM Theory of Computing Symp., Assoc. for Computing Mach., New York, pp. 216?226 (1978)"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(83)90078-6","volume":"26","author":"I.H. Sudborough","year":"1983","unstructured":"Sudborough, I.H.: Bandwidth constraints on problems complete for polynomial time. Theor. Comput. Sci. 26, 25?52 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"CR16","volume-title":"Technical Report, Computer Science Dept., Washington State University","author":"K. Winklmann","year":"1983","unstructured":"Winklmann, K.: On Identifying Causes of Intractability. Technical Report, Computer Science Dept., Washington State University. Washington: Pullman 1983"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288774.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288774\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:27Z","timestamp":1554758067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["BF00288774"],"URL":"https:\/\/doi.org\/10.1007\/bf00288774","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}