{"id":"https://openalex.org/W2037525401","doi":"https://doi.org/10.1007/pl00001596","title":"Verifying the determinant in parallel","display_name":"Verifying the determinant in parallel","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2037525401","doi":"https://doi.org/10.1007/pl00001596","mag":"2037525401"},"language":"en","primary_location":{"id":"doi:10.1007/pl00001596","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00001596","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Complexity","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/A5046562790","display_name":"Mikl\u00f3s S\u00e1ntha","orcid":null},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Santha","raw_affiliation_strings":["CNRS, URA 410, Universit\u00e9 Paris-Sud, 91405 Orsay, France, santha@lri.fr, , , , , , FR","CNRS, URA 410, Universit\u00e9 Paris-Sud, 91405 Orsay, France, santha@lri.fr, , FR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS, URA 410, Universit\u00e9 Paris-Sud, 91405 Orsay, France, santha@lri.fr, , , , , , FR","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"CNRS, URA 410, Universit\u00e9 Paris-Sud, 91405 Orsay, France, santha@lri.fr, , FR","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109793870","display_name":"S. Tan","orcid":null},"institutions":[{"id":"https://openalex.org/I197681013","display_name":"Universit\u00e9 Paris-Est Cr\u00e9teil","ror":"https://ror.org/05ggc9x40","country_code":"FR","type":"education","lineage":["https://openalex.org/I197681013"]},{"id":"https://openalex.org/I2800365227","display_name":"Paris-Est Sup","ror":"https://ror.org/0268ecp52","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"S. Tan","raw_affiliation_strings":["Univ. Paris XII-Val de Marne, 61, av. du G\u00e9n\u00e9ral de Gaulle, 94 010 Cr\u00e9teil Cedex, France, sovanna@univ-paris12.fr, , , , , , FR","Univ. Paris XII-Val de Marne, 61, av. du G\u00e9n\u00e9ral de Gaulle, 94 010 Cr\u00e9teil Cedex, France, sovanna@univ-paris12.fr, , FR"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. Paris XII-Val de Marne, 61, av. du G\u00e9n\u00e9ral de Gaulle, 94 010 Cr\u00e9teil Cedex, France, sovanna@univ-paris12.fr, , , , , , FR","institution_ids":["https://openalex.org/I197681013","https://openalex.org/I2800365227"]},{"raw_affiliation_string":"Univ. Paris XII-Val de Marne, 61, av. du G\u00e9n\u00e9ral de Gaulle, 94 010 Cr\u00e9teil Cedex, France, sovanna@univ-paris12.fr, , FR","institution_ids":["https://openalex.org/I197681013","https://openalex.org/I2800365227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":2.4357,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.88623052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"2","first_page":"128","last_page":"151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6396494507789612},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6329709887504578},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5059251189231873},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.46805140376091003},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4674675464630127},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4648536443710327},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.46167704463005066},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4586804211139679},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4459564685821533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44084253907203674},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4221286475658417},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4165806174278259},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41562458872795105},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.34436142444610596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32958999276161194},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2943185567855835},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.15764504671096802}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6396494507789612},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6329709887504578},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5059251189231873},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.46805140376091003},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4674675464630127},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4648536443710327},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.46167704463005066},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4586804211139679},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4459564685821533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44084253907203674},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4221286475658417},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4165806174278259},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41562458872795105},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34436142444610596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32958999276161194},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2943185567855835},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.15764504671096802},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/pl00001596","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00001596","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Complexity","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01791246v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01791246","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computational Complexity, 1998, 7 (2), pp.128--151. ⟨10.1007/PL00001596⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1538751207","https://openalex.org/W1544807278","https://openalex.org/W1605274574","https://openalex.org/W1996839061","https://openalex.org/W2002927820","https://openalex.org/W2017205387","https://openalex.org/W2027501230","https://openalex.org/W2050151481","https://openalex.org/W2056352038","https://openalex.org/W2062881752","https://openalex.org/W2068264871","https://openalex.org/W2072782913","https://openalex.org/W2082002555","https://openalex.org/W2113097540","https://openalex.org/W2123466414","https://openalex.org/W2170831059","https://openalex.org/W2610884651"],"related_works":["https://openalex.org/W2516690985","https://openalex.org/W3029381898","https://openalex.org/W2077017336","https://openalex.org/W2246807618","https://openalex.org/W2549074966","https://openalex.org/W1999795558","https://openalex.org/W1995176744","https://openalex.org/W1493450096","https://openalex.org/W1564702418","https://openalex.org/W1976287608"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}