Publisher
Springer International Publishing
Reference34 articles.
1. Alon, N.: Splitting necklaces. Adv. Math. 63(3), 247–253 (1987)
2. Beame, P., Cook, S., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. J. Comput. Syst. Sci. 57(1), 3–19 (1998)
3. Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T., Pudlák, P.: Lower bounds on Hilbert’s Nullstellensatz and propositional proofs. Proc. London Math. Soc. 3(1), 1–26 (1996)
4. Buresh-Oppenheim, J., Morioka, T.: Relativized NP search problems and propositional proof systems. In: 19th CCC, pp. 54–67. IEEE (2004)
5. Buss, S.R., Johnson, A.S.: Propositional proofs and reductions between NP search problems. Ann. Pure Appl. Logic 163(9), 1163–1182 (2012)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich;SIAM Journal on Computing;2022-02-28
2. A survey of mass partitions;Bulletin of the American Mathematical Society;2021-02-24
3. Consensus-Halving: Does It Ever Get Easier?;Proceedings of the 21st ACM Conference on Economics and Computation;2020-07-09