N. Immerman
{"title":"描述性的复杂性","authors":"N. Immerman","doi":"10.1007/978-1-4612-0539-5","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":406018,"journal":{"name":"Graduate Texts in Computer Science","volume":"68 1-2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"782","resultStr":"{\"title\":\"Descriptive Complexity\",\"authors\":\"N. Immerman\",\"doi\":\"10.1007/978-1-4612-0539-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":406018,\"journal\":{\"name\":\"Graduate Texts in Computer Science\",\"volume\":\"68 1-2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"782\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graduate Texts in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-1-4612-0539-5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graduate Texts in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-1-4612-0539-5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 782