{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T14:51:18Z","timestamp":1790002278254,"version":"4.0.1"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1990,8]]},"abstract":"<jats:p>The problem of finding locally optimal solutions to combinatorial problems in the framework of PLS as defined by D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis [J. Comput. System Sci., 37(1988), pp. 79\u2013100] is considered. A PLS-complete problem is exhibited such that the problem of verifying local optimality can be solved in LOGSPACE. For all previously known PLS-complete problems, verifying local optimality was P-complete, and it was conjectured in [J. Comput. System Sci., 37(1988), pp. 79\u2013100] that this was necessary.<\/jats:p>","DOI":"10.1137\/0219052","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:33:47Z","timestamp":1109226827000},"page":"742-749","source":"Crossref","is-referenced-by-count":30,"title":["On Finding and Verifying Locally Optimal Solutions"],"prefix":"10.1137","volume":"19","author":[{"given":"Mark W.","family":"Krentel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"Computers and intractability","author":"Garey M.","year":"1979"},{"key":"R2","unstructured":"D. S. Johnson, C. R. Aragon, L. A. McGeoch, C. Schevon,  Optimization by simulated annealing: An experimental evaluation (part I),  1987, manuscript"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90046-3"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"M. W. Krentel,  Structure in locally optimal solutions,  Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC,  1989,  216\u2013221","DOI":"10.1109\/SFCS.1989.63481"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1145\/990518.990519"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0221030"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou, A. A. Sch\u00e4ffer, M. Yannakakis,  On the complexity of local optimality,  Proc. 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD,  1990","DOI":"10.1145\/100216.100274"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0220004"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0219052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:45:26Z","timestamp":1787337926000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0219052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["10.1137\/0219052"],"URL":"https:\/\/doi.org\/10.1137\/0219052","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}