{"id":"https://openalex.org/W2044058053","doi":"https://doi.org/10.1142/s0129054194000189","title":"CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED","display_name":"CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2044058053","doi":"https://doi.org/10.1142/s0129054194000189","mag":"2044058053"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054194000189","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054194000189","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5073254218","display_name":"Pavol \u010euri\u0161","orcid":null},"institutions":[{"id":"https://openalex.org/I74788687","display_name":"Comenius University Bratislava","ror":"https://ror.org/0587ef340","country_code":"SK","type":"education","lineage":["https://openalex.org/I74788687"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"PAVOL \u010eURI\u0160","raw_affiliation_strings":["Department of Computer Science, Comenius University, Mlynsk\u00e1 dolina, 842 15 Bratislava, Slovakia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Comenius University, Mlynsk\u00e1 dolina, 842 15 Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045128977","display_name":"Andrea Roli","orcid":"https://orcid.org/0000-0001-9891-5441"},"institutions":[{"id":"https://openalex.org/I114457229","display_name":"University of Geneva","ror":"https://ror.org/01swzsf04","country_code":"CH","type":"education","lineage":["https://openalex.org/I114457229"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"JOS\u00c9 D.P. ROLIM","raw_affiliation_strings":["Centre Universitaire d\u2019Informatique, Universit\u00e9 de Gen\u00e8ve, 24 rue General Dufour, CH-1211 Gen\u00e8ve 4, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre Universitaire d\u2019Informatique, Universit\u00e9 de Gen\u00e8ve, 24 rue General Dufour, CH-1211 Gen\u00e8ve 4, Switzerland","institution_ids":["https://openalex.org/I114457229"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16661505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"05","issue":"03n04","first_page":"319","last_page":"328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9965000152587891,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9965000152587891,"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/T11191","display_name":"Mathematical functions and polynomials","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9886000156402588,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6759946346282959},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6683803200721741},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6335929036140442},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.6317063570022583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6056445837020874},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4901745915412903},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4811895489692688},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4652479588985443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21585187315940857}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6759946346282959},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6683803200721741},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6335929036140442},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6317063570022583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6056445837020874},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4901745915412903},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4811895489692688},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4652479588985443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21585187315940857},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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":1,"locations":[{"id":"doi:10.1142/s0129054194000189","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054194000189","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.41999998688697815,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1594413440","https://openalex.org/W2804796737","https://openalex.org/W1519201794","https://openalex.org/W1629505938","https://openalex.org/W2767824041","https://openalex.org/W1987322712","https://openalex.org/W44982509","https://openalex.org/W2017181131","https://openalex.org/W2013155780","https://openalex.org/W1968050632"],"abstract_inverted_index":{"We":[0,12,46],"continue":[1],"the":[2,8,81],"investigation":[3],"of":[4,10,83],"polynomial-time":[5],"reducibilities":[6,90],"along":[7],"directions":[9],"[8].":[11],"show":[13,48],"that":[14,49],"there":[15,50],"is":[16,20,33,51,55,66],"a":[17,29,52,62],"set":[18,31,53,64],"which":[19,54],"f(n)-conjunctive":[21,56],"(similarly":[22],"f(n)-disjunctive)":[23],"deterministic":[24,38,57],"polynomial":[25,39,58,70],"time":[26,40,59,71],"reducible":[27,41,60,72],"to":[28,42,61,73],"tally":[30,63,75,86],"but":[32,65],"not":[34,67],"g(n)-conjunctive":[35],"(respectively":[36],"g(n)-disjunctive)":[37],"any":[43,74],"sparse":[44,84],"set.":[45,76],"also":[47],"g(n)-turing":[68],"non-deterministic":[69],"Several":[77],"interesting":[78],"corollaries":[79],"about":[80],"closure":[82],"and":[85],"sets":[87],"under":[88],"such":[89],"follow":[91],"from":[92],"these":[93],"results.":[94]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}