{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:21:03Z","timestamp":1737091263904,"version":"3.33.0"},"reference-count":12,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":4334,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Relations between discrete and continuous complexity models are considered. The present paper is devoted to combine both models. In particular we analyze the 3\u2010Satisfiability problem. The existence of fast decision procedures for this problem over the reals is examined based on certain conditions on the discrete setting. Moreover we study the behaviour of exponential time computations over the reals depending on the real complexity of 3\u2010Satisfiability. This will be done using tools from complexity theory over the integers.<\/jats:p>","DOI":"10.1002\/malq.19950410214","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T17:47:39Z","timestamp":1180201659000},"page":"281-286","source":"Crossref","is-referenced-by-count":1,"title":["On the Relations Between Discrete and Continuous Complexity Theory"],"prefix":"10.1002","volume":"41","author":[{"given":"Klaus","family":"Meer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-75357-2"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(92)90024-6"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196792000244"},{"volume-title":"Computers and Intractability","year":"1979","author":"Garey M. R.","key":"e_1_2_1_6_2"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90024-8"},{"volume-title":"Computability and Complexity Over Structures of Finite Type \u2014 Extended Abstract","year":"1994","author":"Hemmerling A.","key":"e_1_2_1_8_2"},{"key":"e_1_2_1_9_2","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachyan L. G.","year":"1979","journal-title":"Dokl. Akad. Nauk USSR"},{"key":"e_1_2_1_9_3","first-page":"191","volume":"20","year":"1979","journal-title":"Soviet Math. Dokl."},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"Koiran P. A weak version of the Blum\u2010Shub\u2010Smale model. In: 34thIEEE Annual Symposium Foundation of Computer Science (FOCS)1993 pp.486\u2013495.","DOI":"10.1109\/SFCS.1993.366838"},{"key":"e_1_2_1_11_2","first-page":"432","volume-title":"From Topology to Computation: Proceedings of the Smalefest","author":"Megiddo N.","year":"1993"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19950410214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19950410214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:21:01Z","timestamp":1737051661000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19950410214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/malq.19950410214"],"URL":"https:\/\/doi.org\/10.1002\/malq.19950410214","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"type":"print","value":"0942-5616"},{"type":"electronic","value":"1521-3870"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}