S. Cook
{"title":"复杂性类,命题证明系统和形式理论","authors":"S. Cook","doi":"10.1109/LICS.2002.10000","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":6322,"journal":{"name":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","volume":"122 1","pages":"311"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Complexity Classes, Propositional Proof Systems, and Formal Theories\",\"authors\":\"S. Cook\",\"doi\":\"10.1109/LICS.2002.10000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":6322,\"journal\":{\"name\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"122 1\",\"pages\":\"311\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.2002.10000\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.2002.10000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1