{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:21:22Z","timestamp":1648588882293},"reference-count":13,"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\/bf00288777","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T15:51:37Z","timestamp":1096905097000},"page":"433-449","source":"Crossref","is-referenced-by-count":4,"title":["Replaceability and computational equivalence for monotone boolean functions"],"prefix":"10.1007","volume":"22","author":[{"given":"Meurig","family":"Beynon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-13883-8_71","volume":"181","author":"W.M. Beynon","year":"1984","unstructured":"Beynon, W.M.: Replacement in monotone boolean networks: an algebraic perspective. In: Proc. 4th. FST & TCS, Bangalore. Lect. Notes Comput. Sci. 181, 165?178 (1984)","journal-title":"Proc. 4th. FST & TCS, Bangalore. Lect. Notes Comput. Sci."},{"key":"CR2","unstructured":"Beynon, W.M.: Replaceability and computational equivalence in finite distributive lattices. Univ. of Warwick, Theory of Computation Report 61, 1984"},{"key":"CR3","unstructured":"Beynon, W.M.: Geometric aspects of partially-ordered systems. King's College, Univ. of London, Ph.D. thesis, 1973"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1112\/plms\/s3-31.1.114","volume":"3","author":"W.M. Beynon","year":"1975","unstructured":"Beynon, W.M.: Duality theorems for finitely-generated vector lattices. Proc. Lond. Math. Soc. 3, 114?128 (1975)","journal-title":"Proc. Lond. Math. Soc."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1017\/S0305004100053263","volume":"81","author":"W.M. Beynon","year":"1977","unstructured":"Beynon, W.M.: Vector lattices freely generated by distributive lattices. Math. Proc. Camb. Philos. Soc. 81, 193?220 (1977)","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Beynon, W.M., Buckle, J.F.: Computational equivalence and replaceability in finite algebras. Univ. of Warwick, Theory of Computation Report 72, 1985","DOI":"10.1007\/BF00288777"},{"key":"CR7","unstructured":"Birkhoff, G.A.: Lattice Theory, 3rd ed. AMS Colloquium Publications, Vol. XXV, 1967"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Dunne, P.E.: A 2.5n lower bound on the monotone network complexity of T 3 n. Univ. of Warwick, Theory of Computation Report 62, 1984","DOI":"10.1007\/BF00264232"},{"key":"CR9","unstructured":"Dunne, P.E.: Some results on replacement rules in monotone boolean networks. Univ. of Warwick, Theory of Computation Report 64, 1984"},{"key":"CR10","volume-title":"first concepts and distributive lattices","author":"G. Gr\u00e4tzer","year":"1971","unstructured":"Gr\u00e4tzer, G.: Lattice Theory: first concepts and distributive lattices. San Francisco: Freeman 1971"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02241983","volume":"16","author":"K. Mehlhorn","year":"1976","unstructured":"Mehlhorn, K., Galil, Z.: Monotone switching networks and boolean matrix product. Computing 16, 99?111 (1976)","journal-title":"Computing"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(75)90009-2","volume":"1","author":"M.S. Paterson","year":"1975","unstructured":"Paterson, M.S.: Complexity of monotone networks for boolean matrix product. Theor. Comput. Sci. 1, 13?20 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"CR13","unstructured":"Wegener, I.: On the complexity of slice-functions. Univ. of Frankfurt, Internal Report, 1983"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288777.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00288777\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00288777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:59:08Z","timestamp":1585900748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00288777"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["BF00288777"],"URL":"https:\/\/doi.org\/10.1007\/bf00288777","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}