{"id":"https://openalex.org/W2057829027","doi":"https://doi.org/10.1142/s0129054105003376","title":"ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES","display_name":"ADVICE FOR SEMIFEASIBLE SETS AND THE COMPLEXITY-THEORETIC COST(LESSNESS) OF ALGEBRAIC PROPERTIES","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W2057829027","doi":"https://doi.org/10.1142/s0129054105003376","mag":"2057829027"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003376","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003376","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/A5000000572","display_name":"Piotr Faliszewski","orcid":"https://orcid.org/0000-0002-0332-4364"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PIOTR FALISZEWSKI","raw_affiliation_strings":["Department of Computer Science, University of Rochester, Rochester, NY 14627-0226, USA","Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 USA, #TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rochester, Rochester, NY 14627-0226, USA","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 USA, #TAB#","institution_ids":["https://openalex.org/I5388228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088546793","display_name":"Lane A. Hemaspaandra","orcid":"https://orcid.org/0000-0003-0659-5204"},"institutions":[{"id":"https://openalex.org/I5388228","display_name":"University of Rochester","ror":"https://ror.org/022kthw22","country_code":"US","type":"education","lineage":["https://openalex.org/I5388228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"LANE A. HEMASPAANDRA","raw_affiliation_strings":["Department of Computer Science, University of Rochester, Rochester, NY 14627-0226, USA","Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 USA, #TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Rochester, Rochester, NY 14627-0226, USA","institution_ids":["https://openalex.org/I5388228"]},{"raw_affiliation_string":"Department of Computer Science, University of Rochester, Rochester, NY 14627-0226 USA, #TAB#","institution_ids":["https://openalex.org/I5388228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000000572"],"corresponding_institution_ids":["https://openalex.org/I5388228"],"apc_list":null,"apc_paid":null,"fwci":0.7027,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70639301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"05","first_page":"913","last_page":"928"},"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.9993000030517578,"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.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","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"}}],"keywords":[{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.7577626705169678},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6311856508255005},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6125960350036621},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5939236879348755},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.5766900181770325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5454538464546204},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5337396860122681},{"id":"https://openalex.org/keywords/interpreter","display_name":"Interpreter","score":0.4755549132823944},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47250068187713623},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47102126479148865},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44508737325668335},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4116676449775696},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3943471908569336},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34969884157180786},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25388360023498535},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12826865911483765},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10725834965705872}],"concepts":[{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.7577626705169678},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6311856508255005},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6125960350036621},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5939236879348755},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.5766900181770325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5454538464546204},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5337396860122681},{"id":"https://openalex.org/C122783720","wikidata":"https://www.wikidata.org/wiki/Q183065","display_name":"Interpreter","level":2,"score":0.4755549132823944},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47250068187713623},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47102126479148865},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44508737325668335},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4116676449775696},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3943471908569336},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34969884157180786},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25388360023498535},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12826865911483765},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10725834965705872},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003376","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003376","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W23288978","https://openalex.org/W1600387673","https://openalex.org/W1634971465","https://openalex.org/W1940908117","https://openalex.org/W1965972287","https://openalex.org/W1966945335","https://openalex.org/W1970089350","https://openalex.org/W1982717290","https://openalex.org/W1987205876","https://openalex.org/W1992972561","https://openalex.org/W2004966370","https://openalex.org/W2021131202","https://openalex.org/W2033142672","https://openalex.org/W2033152671","https://openalex.org/W2037100948","https://openalex.org/W2037662783","https://openalex.org/W2040131290","https://openalex.org/W2069139349","https://openalex.org/W2069919161","https://openalex.org/W2081662755","https://openalex.org/W2083107908","https://openalex.org/W2083221469","https://openalex.org/W2090186532","https://openalex.org/W2091109792","https://openalex.org/W2092130624","https://openalex.org/W2137407595","https://openalex.org/W2153191867","https://openalex.org/W2173911363","https://openalex.org/W2914018422","https://openalex.org/W4292003697"],"related_works":["https://openalex.org/W2086025566","https://openalex.org/W1702487489","https://openalex.org/W2132910148","https://openalex.org/W2042051386","https://openalex.org/W270168689","https://openalex.org/W113209803","https://openalex.org/W3003471035","https://openalex.org/W2178588595","https://openalex.org/W1629505938","https://openalex.org/W1523547988"],"abstract_inverted_index":{"Informally":[0],"put,":[1],"the":[2,6,28,37,45,49,57,76,146,150,158,165,189,193,200,204,207,240,243,247],"semifeasible":[3,50,58,151,194,248],"sets":[4,9,59,152],"are":[5],"class":[7],"of":[8,21,44,48,96,108,113,130,134,144,149,169,192,202,209,242,246],"having":[10],"a":[11,41,94,97,105,118,124],"polynomial-time":[12],"algorithm":[13],"that,":[14],"given":[15,106,119],"as":[16,78,80,222],"input":[17],"any":[18],"two":[19],"strings":[20],"which":[22],"at":[23,180,184,206],"least":[24,181],"one":[25,32],"belongs":[26],"to":[27,36,74,116,157,178,217,239],"set,":[29],"will":[30,63,72,138,197,227],"choose":[31],"that":[33,126,140,163,229],"does":[34],"belong":[35],"set.":[38,120],"We":[39,137,226],"provide":[40],"tutorial":[42],"overview":[43],"advice":[46,61,91,190,244],"complexity":[47,62,92,102,132,148,173,191,245],"sets.":[51,249],"No":[52],"previous":[53],"familiarity":[54],"with":[55],"either":[56],"or":[60],"be":[64,179,215],"assumed,":[65],"and":[66,88,133,183,224,237],"when":[67],"we":[68,71,196],"include":[69],"proofs":[70],"try":[73],"make":[75],"material":[77],"accessible":[79],"possible":[81],"via":[82],"providing":[83],"intuitive,":[84],"informal":[85],"presentations.":[86],"Karp":[87],"Lipton":[89],"introduced":[90],"about":[93],"quarter":[95],"century":[98],"ago.":[99],"18":[100],"Advice":[101],"asks,":[103],"for":[104,141,164],"power":[107,168],"interpreter,":[109],"how":[110],"many":[111],"bits":[112],"\"help\"":[114],"suffice":[115],"accept":[117],"Thus,":[121],"this":[122,230],"is":[123,153,174,231],"notion":[125],"contains":[127],"aspects":[128],"both":[129,235],"descriptional/informational":[131],"computational":[135],"complexity.":[136],"see":[139,228],"some":[142],"powers":[143],"interpreter":[145],"(worst-case)":[147],"known":[154,176],"right":[155],"down":[156],"bit":[159],"(and":[160],"beyond),":[161],"but":[162],"most":[166,185],"central":[167],"interpreter\u2014deterministic":[170],"polynomial":[171],"time\u2014the":[172],"currently":[175],"only":[177],"linear":[182],"quadratic.":[186],"While":[187],"overviewing":[188],"sets,":[195],"stress":[198],"also":[199],"issue":[201],"whether":[203],"functions":[205],"core":[208],"semifeasibility\u2014so-called":[210],"selector":[211],"functions\u2014can":[212],"without":[213],"cost":[214],"chosen":[216],"possess":[218],"such":[219],"algebraic":[220],"properties":[221],"commutativity":[223],"associativity.":[225],"relevant,":[232],"in":[233],"ways":[234],"potential":[236],"actual,":[238],"study":[241]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}