{"title":"只读一次函数类的非成员证书","authors":"ChistikovDmitry, FedorovaValentina, VoronenkoAndrey","doi":"10.5555/2637677.2637682","DOIUrl":null,"url":null,"abstract":"A certificate of non-membership for a Boolean function f with respect to a class C, f ∉ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any function...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Certificates of Non-Membership for Classes of Read-Once Functions\",\"authors\":\"ChistikovDmitry, FedorovaValentina, VoronenkoAndrey\",\"doi\":\"10.5555/2637677.2637682\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A certificate of non-membership for a Boolean function f with respect to a class C, f ∉ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any function...\",\"PeriodicalId\":56310,\"journal\":{\"name\":\"Fundamenta Informaticae\",\"volume\":\"1 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2014-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fundamenta Informaticae\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.5555/2637677.2637682\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fundamenta Informaticae","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.5555/2637677.2637682","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Certificates of Non-Membership for Classes of Read-Once Functions
A certificate of non-membership for a Boolean function f with respect to a class C, f ∉ C, is a set S of input strings such that the values of f on strings from S are inconsistent with any function...
期刊介绍:
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
solutions by mathematical methods of problems emerging in computer science
solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to):
theory of computing,
complexity theory,
algorithms and data structures,
computational aspects of combinatorics and graph theory,
programming language theory,
theoretical aspects of programming languages,
computer-aided verification,
computer science logic,
database theory,
logic programming,
automated deduction,
formal languages and automata theory,
concurrency and distributed computing,
cryptography and security,
theoretical issues in artificial intelligence,
machine learning,
pattern recognition,
algorithmic game theory,
bioinformatics and computational biology,
quantum computing,
probabilistic methods,
algebraic and categorical methods.