{"date_updated":"2022-01-06T06:51:57Z","has_accepted_license":"1","status":"public","author":[{"full_name":"Abu-Khzam, Faisal N. ","last_name":"Abu-Khzam","first_name":"Faisal N. "},{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"full_name":"Markarian, Christine","last_name":"Markarian","id":"37612","first_name":"Christine"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"year":"2016","language":[{"iso":"eng"}],"_id":"143","file_date_updated":"2018-11-02T14:20:45Z","type":"conference","page":"92-102","date_created":"2017-10-17T12:41:19Z","title":"The Monotone Circuit Value Problem with Bounded Genus Is in NC","publication":"Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"file":[{"file_size":234587,"date_updated":"2018-11-02T14:20:45Z","file_name":"TheMonotoneCircuitValueProblem.pdf","creator":"ups","relation":"main_file","content_type":"application/pdf","date_created":"2018-11-02T14:20:45Z","success":1,"file_id":"5269","access_level":"closed"}],"user_id":"477","citation":{"mla":"Abu-Khzam, Faisal N., et al. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>.","ieee":"F. N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “The Monotone Circuit Value Problem with Bounded Genus Is in NC,” in <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 2016, pp. 92–102.","apa":"Abu-Khzam, F. N., Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The Monotone Circuit Value Problem with Bounded Genus Is in NC. In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i> (pp. 92–102). <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>","short":"F.N. Abu-Khzam, S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, in: Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON), 2016, pp. 92–102.","bibtex":"@inproceedings{Abu-Khzam_Li_Markarian_Meyer auf der Heide_Podlipyan_2016, series={LNCS}, title={The Monotone Circuit Value Problem with Bounded Genus Is in NC}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>}, booktitle={Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)}, author={Abu-Khzam, Faisal N.  and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016}, pages={92–102}, collection={LNCS} }","ama":"Abu-Khzam FN, Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. The Monotone Circuit Value Problem with Bounded Genus Is in NC. In: <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>. LNCS. ; 2016:92-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">10.1007/978-3-319-42634-1_8</a>","chicago":"Abu-Khzam, Faisal N. , Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Monotone Circuit Value Problem with Bounded Genus Is in NC.” In <i>Proceedings of the 22nd International Conference on Computing and Combinatorics (COCOON)</i>, 92–102. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-42634-1_8\">https://doi.org/10.1007/978-3-319-42634-1_8</a>."},"ddc":["000"],"series_title":"LNCS","doi":"10.1007/978-3-319-42634-1_8","abstract":[{"text":"We present an efficient parallel algorithm for the general Monotone Circuit Value Problem (MCVP) with n gates and an underlying graph of bounded genus k. Our algorithm generalizes a recent result by Limaye et al. who showed that MCVP with toroidal embedding (genus 1) is in NC when the input contains a toroidal embedding of the circuit. In addition to extending this result from genus 1 to any bounded genus k, and unlike the work reported by Limaye et al., we do not require a precomputed embedding to be given. Most importantly, our results imply that given a P-complete problem, it is possible to find an algorithm that makes the problem fall into NC by fixing one or more parameters. Hence, we deduce the interesting analogy: Fixed Parameter Parallelizable (FPP) is with respect to P-complete what Fixed Parameter Tractable (FPT) is with respect to NP-complete. Similar work that uses treewidth as parameter was also presented by Elberfeld et al. in [6].","lang":"eng"}]}