Issue Date: 26-29 Sept. 2009rnrntOn page(s): rnt282rnttrn- 289rnrnrnLocation: Timisoara, RomaniarnrnPrint ISBN: 978-1-4244-5910-0rnrnrnrnttrnDigital Object Identifier: href='http://dx.doi.org/10.1109/SYNASC.2009.9' target='_blank'>10.1109/SYNASC.2009.9 rnrnDate of Current Version: trnrnt2010-05-06 14:34:00.0rnrnt rntt class="body-text">rntname="Abstract">>Abstractrn>Disjoint NP-pairs are an interesting model of computation with important applications in cryptography and proof complexity. The question whether there exists a complete disjoint NP-pair was posed by Razborov in 1994 and is one of the most important problems in the field. In this paper we prove that there exists a many-one hard disjoint NP-pair which is computed with;
disjoint NP-pairs; proof complexity generators;
机译:NP完整性,证明系统和不相交的NP-对
机译:每个NP集的P最优证明系统,但没有相对于Oracle的完全不相交的NP对
机译:NP完整性,证明系统和不相交的NP对
机译:关于完整的不相交的NP对存在
机译:不相交的NP对的结构性质和随机预言模型。
机译:卵巢透明细胞癌患者行完全切除而无任何残留肿瘤的患者可能存在隐匿性转移
机译:关于完全不相交的Np对的存在
机译:关于具有“少数”边界的度序列同时边缘不相交实现的存在性。