( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Monte-Carlo Tree Search in Dragline Operation Planning.

, , , и . IEEE Robotics Autom. Lett., 3 (1): 419-425 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Christopher Forbes

Joseph Forbes

Florence Forbes

James Forbes Bell

Anne-Kathrin Forbes

 

Другие публикации лиц с тем же именем

Hitting sets for multilinear read-once algebraic branching programs, in any order., , и . STOC, стр. 867-875. ACM, (2014)Deterministic Divisibility Testing via Shifted Partial Derivatives.. FOCS, стр. 451-465. IEEE Computer Society, (2015)Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs., и . FOCS, стр. 243-252. IEEE Computer Society, (2013)Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good., , , и . Electron. Colloquium Comput. Complex., (2017)Proof Complexity Lower Bounds from Algebraic Circuit Complexity., , , и . CCC, том 50 из LIPIcs, стр. 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Towards Blackbox Identity Testing of Log-Variate Circuits., , и . ICALP, том 107 из LIPIcs, стр. 54:1-54:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs., , , , и . ACM Trans. Comput. Theory, 10 (1): 3:1-3:30 (2018)Polynomial identity testing of read-once oblivious algebraic branching programs.. Massachusetts Institute of Technology, Cambridge, MA, USA, (2014)ndltd.org (oai:dspace.mit.edu:1721.1/89843).Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals., и . STOC, стр. 389-402. ACM, (2022)On identity testing of tensors, low-rank recovery and compressed sensing., и . STOC, стр. 163-172. ACM, (2012)