{"id":"https://openalex.org/W4250141473","doi":"https://doi.org/10.1142/s0129626402000872","title":"THE PARALLEL APPROXIMABILITY OF THE FALSE AND TRUE GATES PROBLEMS FOR NOR-CIRCUITS","display_name":"THE PARALLEL APPROXIMABILITY OF THE FALSE AND TRUE GATES PROBLEMS FOR NOR-CIRCUITS","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W4250141473","doi":"https://doi.org/10.1142/s0129626402000872"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626402000872","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626402000872","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033912650","display_name":"Mar\u0131\u0301a Serna","orcid":"https://orcid.org/0000-0001-9729-8648"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"MARIA SERNA","raw_affiliation_strings":["Departament de LSI, Universitat Polit\u00e8cnica de Catalunya, M\u00f2dul C6 - Campus Nord, Jordi Girona Salgado, 1-3, 08034-Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de LSI, Universitat Polit\u00e8cnica de Catalunya, M\u00f2dul C6 - Campus Nord, Jordi Girona Salgado, 1-3, 08034-Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007964745","display_name":"Fatos Xhafa","orcid":"https://orcid.org/0000-0001-6569-5497"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"FATOS XHAFA","raw_affiliation_strings":["Departament de LSI, Universitat Polit\u00e8cnica de Catalunya, M\u00f2dul C6 - Campus Nord, Jordi Girona Salgado, 1-3, 08034-Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de LSI, Universitat Polit\u00e8cnica de Catalunya, M\u00f2dul C6 - Campus Nord, Jordi Girona Salgado, 1-3, 08034-Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9617848"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40495474,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"01","first_page":"127","last_page":"136"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6917235255241394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6122992634773254},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5545892119407654},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5035588145256042},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4654242694377899},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4542728364467621},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.4452701807022095},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3672363758087158},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3619510531425476},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3351026177406311},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30765026807785034},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3047579526901245}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6917235255241394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6122992634773254},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5545892119407654},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5035588145256042},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4654242694377899},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4542728364467621},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.4452701807022095},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3672363758087158},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3619510531425476},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3351026177406311},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30765026807785034},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3047579526901245},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626402000872","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626402000872","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1992866589","https://openalex.org/W1995016490","https://openalex.org/W2029091075","https://openalex.org/W2038225707","https://openalex.org/W2090133546"],"related_works":["https://openalex.org/W3166204570","https://openalex.org/W3121246613","https://openalex.org/W2132137594","https://openalex.org/W2798482732","https://openalex.org/W3013085049","https://openalex.org/W350499458","https://openalex.org/W2062170304","https://openalex.org/W1560496689","https://openalex.org/W2171197263","https://openalex.org/W2374577476"],"abstract_inverted_index":{"We":[0,34,130],"study":[1],"the":[2,7,37,47,50,84,92,102,107,119,132],"parallel":[3,38,126,154],"approximability":[4,39],"of":[5,9,40,49,69,86,109,112,118,135,143],"computing":[6],"number":[8,68,85,111],"true":[10],"gates":[11,14,71],"and":[12,29,58,64],"false":[13],"for":[15,54,91,101],"circuits":[16,55],"with":[17,56],"only":[18,83],"NOR":[19],"gates,":[20],"we":[21,114],"refer":[22],"to":[23,139],"these":[24,41],"problems":[25,42,73,121],"as":[26],"Nor-False":[27,93],"Gates":[28,31,94,104,137],"Nor-True":[30,103],"Problems,":[32],"respectively.":[33],"show":[35,115],"that":[36,116,146],"depends":[43],"on":[44,46],"restrictions":[45],"topology":[48],"circuit.":[51],"More":[52],"precisely,":[53],"fan-in":[57],"fan-out":[59],"bounded":[60],"by":[61],"a":[62,66,75,141,149],"constant":[63,67],"having":[65],"output":[70],"both":[72],"exhibit":[74],"threshold":[76,89,133,150],"behavior":[77,151],"in":[78,125,152],"their":[79],"parllel":[80],"approximability.":[81,155],"Bounding":[82],"outputs":[87,113],"gives":[88],"results":[90],"Problem":[95,138],"but":[96],"non-approximability":[97],"(for":[98],"any":[99,128],"constant)":[100],"Problem.":[105],"For":[106],"case":[108],"unbounded":[110],"none":[117],"two":[120],"can":[122],"be":[123],"approximated":[124],"within":[127],"constant.":[129],"use":[131],"result":[134],"False":[136],"identify":[140],"subclass":[142],"linear":[144],"programming":[145],"also":[147],"presents":[148],"its":[153]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}