Pub Date : 2019-07-01DOI: 10.1007/978-3-030-19955-5_14
A. Goerdt
{"title":"Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions","authors":"A. Goerdt","doi":"10.1007/978-3-030-19955-5_14","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_14","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124678201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-01DOI: 10.1007/978-3-030-19955-5_15
S. Gryaznov
{"title":"Notes on Resolution over Linear Equations","authors":"S. Gryaznov","doi":"10.1007/978-3-030-19955-5_15","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_15","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115174081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-01DOI: 10.1007/978-3-030-19955-5_20
D. Kravchenko, K. Khadiev, D. Serov
{"title":"On the Quantum and Classical Complexity of Solving Subtraction Games","authors":"D. Kravchenko, K. Khadiev, D. Serov","doi":"10.1007/978-3-030-19955-5_20","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_20","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114239348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-01DOI: 10.1007/978-3-030-19955-5_26
Neeldhara Misra, Piyush Rathi
{"title":"The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs","authors":"Neeldhara Misra, Piyush Rathi","doi":"10.1007/978-3-030-19955-5_26","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_26","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125354144","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-07-01DOI: 10.1007/978-3-030-19955-5_1
Yousef M. Alhamdan, A. Kononov
{"title":"Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem","authors":"Yousef M. Alhamdan, A. Kononov","doi":"10.1007/978-3-030-19955-5_1","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_1","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"125 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129709754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-11DOI: 10.1007/978-3-030-19955-5_6
Václav Blazej, P. Dvořák, T. Valla
{"title":"On Induced Online Ramsey Number of Paths, Cycles, and Trees","authors":"Václav Blazej, P. Dvořák, T. Valla","doi":"10.1007/978-3-030-19955-5_6","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_6","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133768493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-01-03DOI: 10.1007/978-3-030-19955-5_31
Ouri Poupko, Gal Shahaf, E. Shapiro, Nimrod Talmon
{"title":"Sybil-Resilient Conductance-Based Community Growth","authors":"Ouri Poupko, Gal Shahaf, E. Shapiro, Nimrod Talmon","doi":"10.1007/978-3-030-19955-5_31","DOIUrl":"https://doi.org/10.1007/978-3-030-19955-5_31","url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"23 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116188511","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：