符号QBF推理的证明复杂性

{"title":"符号QBF推理的证明复杂性","authors":"S. Mengel, Friedrich Slivovsky","doi":"10.1007/978-3-030-80223-3_28","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Proof Complexity of Symbolic QBF Reasoning\",\"authors\":\"S. Mengel, Friedrich Slivovsky\",\"doi\":\"10.1007/978-3-030-80223-3_28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":446175,\"journal\":{\"name\":\"International Conference on Theory and Applications of Satisfiability Testing\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Theory and Applications of Satisfiability Testing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-80223-3_28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Theory and Applications of Satisfiability Testing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-80223-3_28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}