{"id":"https://openalex.org/W2592241421","doi":"https://doi.org/10.2178/jsl/1190150152","title":"On polynomial time computation over unordered structures","display_name":"On polynomial time computation over unordered structures","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2592241421","doi":"https://doi.org/10.2178/jsl/1190150152","mag":"2592241421"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1190150152","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1190150152","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","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/A5043571692","display_name":"Andreas Blass","orcid":"https://orcid.org/0000-0001-7445-2980"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andreas Blass","raw_affiliation_strings":["Mathematics Department, University of Michigan, Ann Arbor, MI 48109-1109, USA, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department, University of Michigan, Ann Arbor, MI 48109-1109, USA, E-mail:","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065430432","display_name":"Yuri Gurevich","orcid":"https://orcid.org/0000-0001-7808-9293"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuri Gurevich","raw_affiliation_strings":["Microsoft Research, One Microsoft Way, Redmond. WA 98052, USA, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, One Microsoft Way, Redmond. WA 98052, USA, E-mail:","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024923217","display_name":"Saharon Shelah","orcid":"https://orcid.org/0000-0003-0462-3152"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL","US"],"is_corresponding":false,"raw_author_name":"Saharon Shelah","raw_affiliation_strings":["Institute of Mathematics, Hebrew University of Jerusalem, Givat Ram, 91904 Jerusalem, Israel","Mathematics Department, Rutgers University, New Brunswick, NJ 08903, USA, E-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, Hebrew University of Jerusalem, Givat Ram, 91904 Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"Mathematics Department, Rutgers University, New Brunswick, NJ 08903, USA, E-mail:","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":null,"fwci":1.564,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.83946799,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"67","issue":"3","first_page":"1093","last_page":"1125"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10142","display_name":"Formal Methods in Verification","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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/time-complexity","display_name":"Time complexity","score":0.721565842628479},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6452705264091492},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6374855637550354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6111093163490295},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5604610443115234},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5543540716171265},{"id":"https://openalex.org/keywords/square-free-polynomial","display_name":"Square-free polynomial","score":0.4815993010997772},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4810895621776581},{"id":"https://openalex.org/keywords/alternating-polynomial","display_name":"Alternating polynomial","score":0.4448195993900299},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4334399402141571},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.42488452792167664},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3415076732635498},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32785701751708984},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.30413389205932617}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.721565842628479},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6452705264091492},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6374855637550354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6111093163490295},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5604610443115234},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5543540716171265},{"id":"https://openalex.org/C101525915","wikidata":"https://www.wikidata.org/wiki/Q7581979","display_name":"Square-free polynomial","level":4,"score":0.4815993010997772},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4810895621776581},{"id":"https://openalex.org/C170412648","wikidata":"https://www.wikidata.org/wiki/Q4736415","display_name":"Alternating polynomial","level":4,"score":0.4448195993900299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4334399402141571},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.42488452792167664},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3415076732635498},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32785701751708984},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.30413389205932617},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.2178/jsl/1190150152","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1190150152","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.132.6298","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.6298","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.lsa.umich.edu/~ablass/150.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.205.2439","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.2439","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://shelah.logic.at/files/760.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.239.1448","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.239.1448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/math/0102059v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.29.3711","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.3711","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~gurevich/Opera/150.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.61.3199","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.3199","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/~gurevich/Opera/150.pdf","raw_type":"text"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1190150152","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1190150152","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W149380172","https://openalex.org/W179373627","https://openalex.org/W1484653117","https://openalex.org/W1515701089","https://openalex.org/W1532594152","https://openalex.org/W1569165539","https://openalex.org/W1793133712","https://openalex.org/W1966941526","https://openalex.org/W1969402593","https://openalex.org/W1974959615","https://openalex.org/W1984890936","https://openalex.org/W1989783863","https://openalex.org/W1997198079","https://openalex.org/W2045916776","https://openalex.org/W2083343164","https://openalex.org/W2088094394","https://openalex.org/W2116445981","https://openalex.org/W2117313088","https://openalex.org/W2164809404","https://openalex.org/W2181072414","https://openalex.org/W2492276029","https://openalex.org/W2798367342","https://openalex.org/W2984059665","https://openalex.org/W3034806751","https://openalex.org/W3105529609","https://openalex.org/W4210731599"],"related_works":["https://openalex.org/W4320022211","https://openalex.org/W1518546215","https://openalex.org/W3005925191","https://openalex.org/W4221160330","https://openalex.org/W1543706171","https://openalex.org/W148891984","https://openalex.org/W1964170686","https://openalex.org/W2221056095","https://openalex.org/W2955084533","https://openalex.org/W2592241421"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2,87],"is":[3,46],"motivated":[4],"by":[5],"the":[6,26,29,57,69,83,129,159],"question":[7],"whether":[8],"there":[9],"exists":[10],"a":[11,60,64,86,145],"logic":[12,43],"capturing":[13],"polynomial":[14,37,74,99,112,121,163,167],"time":[15,75,100,113,122,164,168],"computation":[16],"over":[17],"unordered":[18],"structures.":[19],"We":[20,39,67,80],"consider":[21],"several":[22],"algorithmic":[23],"problems":[24],"near":[25],"border":[27],"of":[28,59,88,132,141,161],"known,":[30],"logically":[31],"defined":[32],"complexity":[33],"classes":[34],"contained":[35],"in":[36,52,63,85,97,103,111,119,144],"time.":[38],"show":[40,81],"that":[41,53,72,82,137],"fixpoint":[42,77,104],"plus":[44,78,105,123,169],"counting":[45],"stronger":[47],"than":[48],"might":[49],"be":[50,118],"expected,":[51],"it":[54],"can":[55],"express":[56],"existence":[58],"complete":[61],"matching":[62],"bipartite":[65],"graph.":[66],"revisit":[68],"known":[70],"examples":[71,84,131],"separate":[73],"from":[76,165],"counting.":[79,106,124,170],"Cai,":[89],"F\u00fcrer,":[90],"and":[91,134],"Immerman,":[92],"when":[93],"suitably":[94,148],"padded,":[95],"are":[96],"choiceless":[98,120,166],"yet":[101],"not":[102,116],"Without":[107],"padding,":[108],"they":[109],"remain":[110],"but":[114],"appear":[115],"to":[117],"Similar":[125],"results":[126],"hold":[127],"for":[128,158],"multipede":[130],"Gurevich":[133],"Shelah,":[135],"except":[136],"their":[138],"final":[139],"version":[140],"multipedes":[142],"is,":[143],"sense,":[146],"already":[147],"padded.":[149],"Finally,":[150],"we":[151],"describe":[152],"another":[153],"possible":[154],"candidate,":[155],"involving":[156],"determinants,":[157],"task":[160],"separating":[162]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}