{"id":"https://openalex.org/W2052728924","doi":"https://doi.org/10.1142/s0129054113400376","title":"UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(<font>log log</font> n)","display_name":"UNARY CODED NP-COMPLETE LANGUAGES IN ASPACE(<font>log log</font> n)","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2052728924","doi":"https://doi.org/10.1142/s0129054113400376","mag":"2052728924"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113400376","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400376","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/A5065408637","display_name":"Viliam Geffert","orcid":"https://orcid.org/0000-0001-9143-1479"},"institutions":[{"id":"https://openalex.org/I204881574","display_name":"University of Pavol Jozef \u0160af\u00e1rik","ror":"https://ror.org/039965637","country_code":"SK","type":"education","lineage":["https://openalex.org/I204881574"]},{"id":"https://openalex.org/I4210127527","display_name":"Slovak Research and Development Agency","ror":"https://ror.org/037nx0e70","country_code":"SK","type":"government","lineage":["https://openalex.org/I4210127527"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"VILIAM GEFFERT","raw_affiliation_strings":["Department of Computer Science, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 04154 Ko\u0161ice, Slovakia","Supported by the Slovak Grant Agency for Science under contract VEGA 1/0479/12 \"Combinatorial Structures and Complexity of Algorithms\", and by the Slovak Research and Development Agency under contract APVV-0035-10 \"Algorithms, Automata, and Discrete Data Structures\""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, P. J. \u0160af\u00e1rik University, Jesenn\u00e1 5, 04154 Ko\u0161ice, Slovakia","institution_ids":["https://openalex.org/I204881574"]},{"raw_affiliation_string":"Supported by the Slovak Grant Agency for Science under contract VEGA 1/0479/12 \"Combinatorial Structures and Complexity of Algorithms\", and by the Slovak Research and Development Agency under contract APVV-0035-10 \"Algorithms, Automata, and Discrete Data Structures\"","institution_ids":["https://openalex.org/I4210127527"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005357145","display_name":"Dana Pardubsk\u00e1","orcid":null},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"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":["AT","SK"],"is_corresponding":false,"raw_author_name":"DANA PARDUBSK\u00c1","raw_affiliation_strings":["Department of Computer Science, Comenius University, Mlynsk\u00e1 dolina, 84248 Bratislava, Slovakia","Partially supported by the Slovak Grant Agency for Science under contract VEGA 1/0979/12 \"Theory of Information, Models, Complexity and Algorithms\""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Comenius University, Mlynsk\u00e1 dolina, 84248 Bratislava, Slovakia","institution_ids":["https://openalex.org/I74788687"]},{"raw_affiliation_string":"Partially supported by the Slovak Grant Agency for Science under contract VEGA 1/0979/12 \"Theory of Information, Models, Complexity and Algorithms\"","institution_ids":["https://openalex.org/I4210099593"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3645,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64884898,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":"07","first_page":"1167","last_page":"1182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9998999834060669,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9995999932289124,"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/T11269","display_name":"Algorithms and Data Compression","score":0.998199999332428,"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/unary-operation","display_name":"Unary operation","score":0.8608898520469666},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7066739797592163},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6993809342384338},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6702746748924255},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.6199953556060791},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5833556652069092},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5254156589508057},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5100158452987671},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4977986812591553},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2127278447151184}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.8608898520469666},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7066739797592163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6993809342384338},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6702746748924255},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.6199953556060791},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5833556652069092},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5254156589508057},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5100158452987671},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4977986812591553},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2127278447151184}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113400376","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113400376","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W150474545","https://openalex.org/W1963893271","https://openalex.org/W1974938157","https://openalex.org/W1982129592","https://openalex.org/W2089947021","https://openalex.org/W2095020693","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W1945859206","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W2065008672","https://openalex.org/W2950408827"],"abstract_inverted_index":{"We":[0],"shall":[1],"show":[2,149],"that":[3,15,43,74,143,150],"(i)":[4],"there":[5,34],"exists":[6,35],"a":[7,36,70,162],"binary":[8,37,85,151],"NP-complete":[9],"language":[10,38,58],"[Formula:":[11,20,39,47,59,98],"see":[12,21,40,48,60,99],"text]":[13,22,41,49,61,100],"such":[14,42],"its":[16,44],"unary":[17,45,83,154],"coded":[18],"version":[19,46],"is":[23,50,63,101,109],"in":[24,51,65,156,167],"ASPACE(":[25,52,66,157],"log":[26,27,53,54,67,128,134,138,139,158,159],"n),":[28,55,129],"(ii)":[29],"if":[30,104],"P":[31,75],"\u2260":[32,76,145],"NP,":[33,77],"while":[56],"the":[57,78,96,119],"itself":[62],"not":[64,88,165],"n).":[68,140],"As":[69],"consequence,":[71],"under":[72],"assumption":[73,142],"standard":[79],"space":[80],"translation":[81],"between":[82],"and":[84,114,130],"languages":[86,155],"does":[87],"work":[89],"for":[90,117,123,132],"alternating":[91],"machines":[92],"with":[93],"small":[94],"space;":[95],"equivalence":[97,121],"valid":[102],"only":[103],"s(n)":[105,125],"\u2208":[106,126,136],"\u03a9(n).":[107],"This":[108],"quite":[110],"different":[111],"from":[112],"deterministic":[113],"nondeterministic":[115],"machines,":[116],"which":[118],"corresponding":[120],"holds":[122],"each":[124],"\u03a9(":[127,137],"hence":[131],"s(":[133],"n)":[135,160],"Under":[141],"NP":[144],"co-NP,":[146],"we":[147],"also":[148],"versions":[152],"of":[153],"form":[161],"complexity":[163],"class":[164],"contained":[166],"NP.":[168]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}