Funder
Engineering and Physical Sciences Research Council
Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Splitting necklaces;Alon;Adv. Math.,1987
2. The relative complexity of NP search problems;Beame;J. Comput. Syst. Sci.,1998
3. Lower bounds on Hilbert's Nullstellensatz and propositional proofs;Beame;Proc. Lond. Math. Soc.,1996
4. Relativized NP search problems and propositional proof systems;Buresh-Oppenheim,2004
5. Propositional proofs and reductions between NP search problems;Buss;Ann. Pure Appl. Log.,2012
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Consensus-Halving: Does It Ever Get Easier?;SIAM Journal on Computing;2023-04-04
2. Consensus Halving for Sets of Items;Mathematics of Operations Research;2022-11
3. Constant inapproximability for PPA;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09