{"id":"https://openalex.org/W2548839942","doi":"https://doi.org/10.1109/icacci.2016.7732087","title":"A fast universal search by equivalent program pruning","display_name":"A fast universal search by equivalent program pruning","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2548839942","doi":"https://doi.org/10.1109/icacci.2016.7732087","mag":"2548839942"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2016.7732087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2016.7732087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-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/A5078651885","display_name":"Swarna Kamal Paul","orcid":"https://orcid.org/0000-0002-2362-935X"},"institutions":[{"id":"https://openalex.org/I55215948","display_name":"Tata Consultancy Services (India)","ror":"https://ror.org/01b9n8m42","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210086519","https://openalex.org/I55215948"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Swarna Kamal Paul","raw_affiliation_strings":["Information Technology, Tata Consultancy Services, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Information Technology, Tata Consultancy Services, Kolkata, India","institution_ids":["https://openalex.org/I55215948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042877131","display_name":"Parama Bhaumik","orcid":"https://orcid.org/0000-0003-2501-0558"},"institutions":[{"id":"https://openalex.org/I55215948","display_name":"Tata Consultancy Services (India)","ror":"https://ror.org/01b9n8m42","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210086519","https://openalex.org/I55215948"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Parama Bhaumik","raw_affiliation_strings":["Information Technology, Tata Consultancy Services, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Information Technology, Tata Consultancy Services, Kolkata, India","institution_ids":["https://openalex.org/I55215948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078651885"],"corresponding_institution_ids":["https://openalex.org/I55215948"],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6854943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"454","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9976999759674072,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9976999759674072,"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.996999979019165,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9933000206947327,"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/pruning","display_name":"Pruning","score":0.8288919925689697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6271975636482239},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.6020160913467407},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5375726819038391},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5346938967704773},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4758070409297943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4754188656806946},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4449644386768341},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4405137002468109},{"id":"https://openalex.org/keywords/linear-search","display_name":"Linear search","score":0.4382261037826538},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.4343898296356201},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.4342448115348816},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.41085344552993774},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.3653239905834198},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35218048095703125},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.12552326917648315}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.8288919925689697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6271975636482239},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.6020160913467407},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5375726819038391},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5346938967704773},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4758070409297943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4754188656806946},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4449644386768341},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4405137002468109},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.4382261037826538},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.4343898296356201},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.4342448115348816},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.41085344552993774},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3653239905834198},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35218048095703125},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.12552326917648315},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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.1109/icacci.2016.7732087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2016.7732087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1486056878","https://openalex.org/W1521977997","https://openalex.org/W1530941242","https://openalex.org/W1638203394","https://openalex.org/W1646752922","https://openalex.org/W2005097301","https://openalex.org/W2011058337","https://openalex.org/W2041517255","https://openalex.org/W2059023668","https://openalex.org/W2084323233","https://openalex.org/W2105361488","https://openalex.org/W2132304387","https://openalex.org/W2135625884","https://openalex.org/W2146947872","https://openalex.org/W2148452608","https://openalex.org/W2215054329","https://openalex.org/W3003623942","https://openalex.org/W3148481862","https://openalex.org/W4213350211","https://openalex.org/W4285719527","https://openalex.org/W6631290782","https://openalex.org/W6636753242","https://openalex.org/W6681351171"],"related_works":["https://openalex.org/W2808808802","https://openalex.org/W2064794194","https://openalex.org/W4200104947","https://openalex.org/W2998661990","https://openalex.org/W2585326820","https://openalex.org/W4213195198","https://openalex.org/W169590971","https://openalex.org/W2354057059","https://openalex.org/W562051371","https://openalex.org/W1495526931"],"abstract_inverted_index":{"Universal":[0],"search":[1,78,93,98,109,125,133],"is":[2,47,114],"the":[3,30,55,60,68,73,92,97,108,131],"asymptotically":[4],"fastest":[5],"method":[6,17,79,134],"to":[7,21,48],"solve":[8],"a":[9,103,128,138,141],"wide":[10],"class":[11],"of":[12,59,107],"inversion":[13],"problems.":[14],"Recently":[15],"this":[16,37,50],"has":[18,117],"been":[19,119],"used":[20],"develop":[22],"several":[23,83],"efficient":[24],"optimal":[25],"general":[26],"problem":[27],"solvers.":[28],"However":[29],"huge":[31,104],"constant":[32,51],"slowdown":[33,52],"factor":[34,53],"associated":[35],"with":[36],"algorithm":[38,61],"prevents":[39],"it":[40,116],"from":[41],"widespread":[42],"practical":[43],"application.":[44],"Our":[45],"endeavor":[46],"reduce":[49,91],"in":[54,67],"non":[56],"incremental":[57,69],"version":[58],"which":[62],"can":[63,126,135],"be":[64],"easily":[65],"extended":[66],"version.":[70],"While":[71],"searching":[72],"exponential":[74],"program":[75],"space,":[76],"universal":[77,124],"generates":[80],"and":[81,95],"tests":[82],"equivalent":[84,87],"programs.":[85],"Pruning":[86],"programs":[88],"will":[89],"evidently":[90],"space":[94],"consequently":[96],"time.":[99],"Experimental":[100],"analysis":[101],"reveals":[102],"speed":[105],"up":[106],"method.":[110],"Even":[111],"though":[112],"pruning":[113],"applied":[115],"also":[118],"shown":[120],"theoretically":[121],"that":[122],"if":[123],"find":[127,137],"solution":[129,139],"then":[130],"proposed":[132],"always":[136],"for":[140],"given":[142],"problem.":[143]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}