Author:
Spakowski Holger,Thakur Mayur,Tripathi Rahul
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference55 articles.
1. Quantum computability;Adleman;SIAM Journal on Computing,1997
2. The complexity of sparse sets in P;Allender,1986
3. P-printable sets;Allender;SIAM Journal on Computing,1988
4. Relativizations of the P=?NP question;Baker;SIAM Journal on Computing,1975
5. Relativized counting classes: Relations among thresholds, parity, and mods;Beigel;Journal of Computer and System Sciences,1991
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Quantum Computing Review: A Decade of Research;IEEE Transactions on Engineering Management;2023
2. The Rise of Metaverse and Interoperability with Split-Protocol;2022 IEEE 23rd International Conference on Information Reuse and Integration for Data Science (IRI);2022-08
3. The Robustness of LWPP and WPP, with an Application to Graph Reconstruction;computational complexity;2020-10-29
4. An overview of quantum computation models: quantum automata;Frontiers of Computer Science in China;2008-06
5. LWPP and WPP are not uniformly gap-definable;Journal of Computer and System Sciences;2006-06