{"id":"https://openalex.org/W1576664188","doi":"https://doi.org/10.1007/s00453-007-9039-0","title":"Approximability of Minimum AND-Circuits","display_name":"Approximability of Minimum AND-Circuits","publication_year":2007,"publication_date":"2007-09-27","ids":{"openalex":"https://openalex.org/W1576664188","doi":"https://doi.org/10.1007/s00453-007-9039-0","mag":"1576664188"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-007-9039-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9039-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086010026","display_name":"Jan Arpe","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jan Arpe","raw_affiliation_strings":["Department of Statistics, University of California, 367 Evans Hall #3860, Berkeley, CA, 94720-3860, USA","University of California, Department of Statistics, 367 Evans Hall #3860, 94720-3860, Berkeley, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Statistics, University of California, 367 Evans Hall #3860, Berkeley, CA, 94720-3860, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Department of Statistics, 367 Evans Hall #3860, 94720-3860, Berkeley, CA, USA#TAB#","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT, 06520-8285, USA","Yale University, Department of Computer Science, P.O. Box 208285, 06520-8285, New Haven, CT, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, P.O. Box 208285, New Haven, CT, 06520-8285, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Yale University, Department of Computer Science, P.O. Box 208285, 06520-8285, New Haven, CT, USA#TAB#","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086010026"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05906215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":"3","first_page":"337","last_page":"357"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987999796867371,"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":0.9987999796867371,"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/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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/T10142","display_name":"Formal Methods in Verification","score":0.9975000023841858,"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/monomial","display_name":"Monomial","score":0.9405086040496826},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6907059550285339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6175849437713623},{"id":"https://openalex.org/keywords/monomial-basis","display_name":"Monomial basis","score":0.5635095834732056},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5084785223007202},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49703577160835266},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48903974890708923},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4554152488708496},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4177211821079254},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24119585752487183},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0704488456249237},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05724072456359863}],"concepts":[{"id":"https://openalex.org/C11252640","wikidata":"https://www.wikidata.org/wiki/Q243723","display_name":"Monomial","level":2,"score":0.9405086040496826},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6907059550285339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6175849437713623},{"id":"https://openalex.org/C46132437","wikidata":"https://www.wikidata.org/wiki/Q6901742","display_name":"Monomial basis","level":3,"score":0.5635095834732056},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5084785223007202},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49703577160835266},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48903974890708923},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4554152488708496},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4177211821079254},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24119585752487183},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0704488456249237},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05724072456359863},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1007/s00453-007-9039-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-007-9039-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/f7f9d5c9-7d86-4bec-9967-1d94cb3129cd","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/f7f9d5c9-7d86-4bec-9967-1d94cb3129cd","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Arpe, J & Manthey, B 2009, 'Approximability of Minimum AND-Circuits', Algorithmica, vol. 53, no. 3, pp. 337-357. https://doi.org/10.1007/s00453-007-9039-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.429.6559","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.6559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2006/045/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.429.8082","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.8082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2006/045/revision/1/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.9471","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.9471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cc.cs.uni-sb.de/manthey/publications/SWAT2006_ArpeManthey_MinimumAND.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.7549","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.7549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cc.cs.uni-sb.de/manthey/publications/Algorithmica_ArpeManthey_MinimumAND.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.9376","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.9376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stat.berkeley.edu/~arpe/papers/ArpMan05ANDCircuits.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.77","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.77","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2006/603/pdf/06111.ArpeJan.Paper.603.pdf","raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:603","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.4","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/dagsemproc.06111.4","is_oa":true,"landing_page_url":"https://doi.org/10.4230/dagsemproc.06111.4","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:1576664188","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc13.html#ArpeM06","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null},{"id":"mag:1905483472","is_oa":false,"landing_page_url":"http://drops.dagstuhl.de/opus/volltexte/2006/603/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418148","display_name":"Dagstuhl Seminar Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Dagstuhl Seminar Proceedings","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:603","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.4","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322414","display_name":"Universit\u00e4t zu L\u00fcbeck","ror":"https://ror.org/00t3r8h32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1495932320","https://openalex.org/W1517585663","https://openalex.org/W1587602953","https://openalex.org/W1965297065","https://openalex.org/W1966819396","https://openalex.org/W1970172343","https://openalex.org/W1973315504","https://openalex.org/W1977545325","https://openalex.org/W1980842804","https://openalex.org/W1993204154","https://openalex.org/W2012391569","https://openalex.org/W2030087828","https://openalex.org/W2034339630","https://openalex.org/W2040924621","https://openalex.org/W2046132190","https://openalex.org/W2080169294","https://openalex.org/W2113004376","https://openalex.org/W2126546664","https://openalex.org/W2130956967","https://openalex.org/W2137560895","https://openalex.org/W2468918395","https://openalex.org/W2486715098","https://openalex.org/W2913688336","https://openalex.org/W4292230561"],"related_works":["https://openalex.org/W2183312547","https://openalex.org/W3098082123","https://openalex.org/W2091368663","https://openalex.org/W1533622011","https://openalex.org/W2593041831","https://openalex.org/W2513873863","https://openalex.org/W2949799193","https://openalex.org/W2092838574","https://openalex.org/W2263465034","https://openalex.org/W2798325735","https://openalex.org/W2073435288","https://openalex.org/W2182048694","https://openalex.org/W2795976437","https://openalex.org/W2474846329","https://openalex.org/W1661159058","https://openalex.org/W2953319076","https://openalex.org/W2963467514","https://openalex.org/W1507596701","https://openalex.org/W2950179857","https://openalex.org/W939766015"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}