Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set
暂无分享,去创建一个
[1] P. McMullen. Convex Sets and Their Applications , 1982 .
[2] Christos H. Papadimitriou,et al. Exponential lower bounds for finding Brouwer fixed points , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[3] Robin Milner. An Action Structure for Synchronous pi-Calculus , 1993, FCT.
[4] Pierluigi Crescenzi,et al. Sperner's lemma and robust machines , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[5] Takuya Iimura. A discrete fixed point theorem and its applications , 2003 .
[6] Miklos Santha,et al. On the Black-Box Complexity of Sperner's Lemma , 2005, FCT.
[7] Xi Chen,et al. On algorithms for discrete and approximate brouwer fixed points , 2005, STOC '05.
[8] Yu. B. Zudin,et al. Mat hemat ical Engineering , 2003 .
[9] Gerard van der Laan,et al. Solving Discrete Zero Point Problems , 2004 .
[10] R. Kannan,et al. Convex Sets and their Applications , 2006 .
[11] Gerard van der Laan,et al. A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems , 2007, SIAM J. Optim..
[12] Miklos Santha,et al. On the Black-Box Complexity of Sperner’s Lemma , 2008, Theory of Computing Systems.