Michael A Forbes

20082018
If you made any changes in Pure, your changes will be visible here soon.

Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.

  • 2 Similar Profiles
Polynomials Engineering & Materials Science
Testing Engineering & Materials Science
Networks (circuits) Engineering & Materials Science
Hitting Set Mathematics
Polynomial Identities Mathematics
Tensors Engineering & Materials Science
Branching Programs Mathematics
Lower bound Mathematics

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Research Output 2008 2018

  • 15 Conference contribution
  • 5 Article

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

Forbes, M. A. & Shpilka, A., Jun 20 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 87-99 13 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Polynomials
Networks (circuits)
Geometry

Identity testing and lower bounds for read-k oblivious algebraic branching programs

Anderson, M., Forbes, M. A., Saptharishi, R., Shpilka, A. & Volk, B. L., Jan 2018, In : ACM Transactions on Computation Theory. 10, 1, 3.

Research output: Contribution to journalArticle

Branching Programs
Polynomials
Lower bound
Testing
Polynomial Identities

Pseudorandom generators for read-once branching programs, in any order

Forbes, M. A. & Kelley, Z., Nov 30 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, Vol. 2018-October. p. 946-955 10 p. 8555171

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Seed
Polynomials

Spatial isolation implies zero knowledge even in a quantum world

Chiesa, A., Forbes, M. A., Gur, T. & Spooner, N., Nov 30 2018, Proceedings - 59th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2018. Thorup, M. (ed.). IEEE Computer Society, p. 755-765 11 p. 8555155. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2018-October).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Quantum entanglement
Quantum theory
Cryptography
Acoustic waves
Testing

Succinct hitting sets and barriers to proving lower bounds for algebraic circuits

Forbes, M. A., Shpilka, A. & Volk, B. L., Jan 1 2018, In : Theory of Computing. 14, 18.

Research output: Contribution to journalArticle

Hitting Set
Lower bound
Networks (circuits)
Complexity Theory
Polynomials