Michael A. Forbes

发表

On the locality of codeword symbols in non-linear codes

Sergey Yekhanin, Michael A. Forbes, S. Yekhanin, 2013, Discret. Math..

A PSPACE construction of a hitting set for the closure of small algebraic circuits

Amir Shpilka, Michael A. Forbes, Amir Shpilka, 2017, Electron. Colloquium Comput. Complex..

Hitting sets for multilinear read-once algebraic branching programs, in any order

Ramprasad Saptharishi, Amir Shpilka, Michael A. Forbes, 2014, STOC.

On identity testing of tensors, low-rank recovery and compressed sensing

Amir Shpilka, Michael A. Forbes, Amir Shpilka, 2011, STOC '12.

A Zero Knowledge Sumcheck and its Applications pdf

Michael A. Forbes, Alessandro Chiesa, Nicholas Spooner, 2017, IACR Cryptol. ePrint Arch..

Deterministic Divisibility Testing via Shifted Partial Derivatives

Michael A. Forbes, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs

Ramprasad Saptharishi, Matthew Anderson, Michael A. Forbes, 2018, ACM Trans. Comput. Theory.

Puzzle - The Fillomino Puzzle

Michael A. Forbes, Robin H. Pearce, 2017, INFORMS Trans. Educ..

Towards blackbox identity testing of log-variate circuits

Nitin Saxena, Michael A. Forbes, Sumanta Ghosh, 2018, Electron. Colloquium Comput. Complex..

Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits

Amir Shpilka, Michael A. Forbes, Ben lee Volk, 2018, Theory Comput..

Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem

Michael A. Forbes, Robin H. Pearce, M. Forbes, 2018, Eur. J. Oper. Res..

Succinct hitting sets and barriers to proving algebraic circuits lower bounds

Amir Shpilka, Michael A. Forbes, Ben lee Volk, 2017, STOC.

Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing pdf

Amir Shpilka, Michael A. Forbes, Amir Shpilka, 2013, APPROX-RANDOM.

Optimizing Network Designs for the World's Largest Broadband Project

Michael A. Forbes, Paul Kennedy, Peter Ferris, 2015, Interfaces.

Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs

Ramprasad Saptharishi, Matthew Anderson, Amir Shpilka, 2015, Electron. Colloquium Comput. Complex..

Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order pdf

Ramprasad Saptharishi, Amir Shpilka, Michael A. Forbes, 2013, Electron. Colloquium Comput. Complex..

Improved Soundness for QMA with Multiple Provers

Michael A. Forbes, Alessandro Chiesa, A. Chiesa, 2011, Electron. Colloquium Comput. Complex..

Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs

Amir Shpilka, Michael A. Forbes, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Tensor Rank: Some Lower and Upper Bounds

Boris Alexeev, Jacob Tsimerman, Michael A. Forbes, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Complexity Theory Column 88

Amir Shpilka, Michael A. Forbes, Amir Shpilka, 2015, SIGACT News.

Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity

Ramprasad Saptharishi, Mrinal Kumar, Michael A. Forbes, 2016, Computational Complexity Conference.

Polynomial identity testing of read-once oblivious algebraic branching programs

Michael A. Forbes, 2014 .

A Survey of Binary Covering Arrays

Jeff Yu Lei, Raghu Kacker, D. Richard Kuhn, 2011, Electron. J. Comb..

Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant pdf

Neeraj Kayal, Rajat Mittal, Michael A. Forbes, 2011, ArXiv.

On Probabilistic Checking in Perfect Zero Knowledge

Eli Ben-Sasson, Ariel Gabizon, Michael A. Forbes, 2016, IACR Cryptol. ePrint Arch..

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good pdf

Nitin Saxena, Manindra Agrawal, Michael A. Forbes, 2017, Electron. Colloquium Comput. Complex..

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Tom Gur, Michael A. Forbes, Alessandro Chiesa, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Zero Knowledge Protocols from Succinct Constraint Detection

Eli Ben-Sasson, Ariel Gabizon, Michael A. Forbes, 2017, TCC.

Dimension Expanders via Rank Condensers pdf

Venkatesan Guruswami, Michael A. Forbes, V. Guruswami, 2014, Electron. Colloquium Comput. Complex..

Pseudorandom Generators for Read-Once Branching Programs, in Any Order

Michael A. Forbes, Zander Kelley, Zander Kelley, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Proof Complexity Lower Bounds from Algebraic Circuit Complexity pdf

Avi Wigderson, Iddo Tzameret, Amir Shpilka, 2016, Electron. Colloquium Comput. Complex..

Proof Complexity Lower Bounds from Algebraic Circuit Complexity

Avi Wigderson, Iddo Tzameret, Amir Shpilka, 2021, Theory of Computing.

Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals

Michael A. Forbes, Robert Andrews, 2021, Electron. Colloquium Comput. Complex..

Deterministic Divisibility Testing via Shifted Partial Derivatives (Extended Abstract)

Michael A. Forbes, 2015 .

A Survey of Binary Covering Arrays | NIST

Raghu N. Kacker, David R. Kuhn, Jim Lawrence, 2011 .

Challenges in Polynomial Factorization ∗

Michael A. Forbes, Amir Shpilka, 2015 .

A Note on QMA with Multiple Provers

Michael A. Forbes, A. Chiesa, 2010 .

Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals

Michael A. Forbes, Robert Andrews, 2021, Electron. Colloquium Comput. Complex..

Towards blackbox identity testing of log-variate

Michael A. Forbes, Nitin Saxena, S. Ghosh, 2018 .

Refining the In-Parameter-Order Strategy for Constructing Covering Arrays

Yu Lei, D. Richard Kuhn, Raghu N. Kacker, 2008, Journal of research of the National Institute of Standards and Technology.