{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T02:09:09Z","timestamp":1676686149367},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p> We continue to search for methods of parallel computing using light. An algorithm for solving instances of the Boolean satisfiability problem is given and illustrated using a photocopying machine with plastic transparencies as medium. The algorithm solves satisfiability problems in linear time but requires the assumption that information can be stored with a density that is exponential in the number of variables in the problem instance. Consideration is given to situations in which this density limitation is not quite absolute. <\/jats:p>","DOI":"10.1142\/s0129626407003071","type":"journal-article","created":{"date-parts":[[2008,1,22]],"date-time":"2008-01-22T06:36:09Z","timestamp":1200983769000},"page":"339-347","source":"Crossref","is-referenced-by-count":5,"title":["PHOTOCOMPUTING: EXPLORATIONS WITH TRANSPARENCY AND OPACITY"],"prefix":"10.1142","volume":"17","author":[{"given":"TOM","family":"HEAD","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Binghamton University, Binghamton, New York 13902-6000, United States"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0313-4_5"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-30296-4_20"},{"key":"rf3","series-title":"Series in Knots and Everything","volume-title":"Current Developments in Mathematical Biology","volume":"38","author":"Gal S.","year":"2007"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02960757"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-004-3379-3"},{"key":"rf8","author":"Oltean M.","journal-title":"Natural Computing"},{"key":"rf9","author":"Oltean M.","journal-title":"Natural Computing"},{"key":"rf11","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf12","first-page":"136","volume":"55","author":"Hartmanis J.","journal-title":"Bulletin EATCS"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626407003071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:16:07Z","timestamp":1565093767000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626407003071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0129626407003071"],"URL":"https:\/\/doi.org\/10.1142\/s0129626407003071","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}