The following pages link to Michael A. Forbes (Q1690266):
Displaying 19 items.
- (Q540078) (redirect page) (← links)
- A survey of binary covering arrays (Q540079) (← links)
- Zero knowledge protocols from succinct constraint detection (Q1690269) (← links)
- On the locality of codeword symbols in non-linear codes (Q2440947) (← links)
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing (Q2851883) (← links)
- (Q4612482) (← links)
- Succinct hitting sets and barriers to proving algebraic circuits lower bounds (Q4978011) (← links)
- (Q5002729) (← links)
- (Q5028363) (← links)
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World (Q5066952) (← links)
- A PSPACE construction of a hitting set for the closure of small algebraic circuits (Q5230372) (← links)
- Hitting sets for multilinear read-once algebraic branching programs, in any order (Q5259623) (← links)
- Dimension Expanders via Rank Condensers (Q5351936) (← links)
- Proof Complexity Lower Bounds from Algebraic Circuit Complexity (Q5368766) (← links)
- Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity (Q5368767) (← links)
- (Q5414620) (← links)
- On identity testing of tensors, low-rank recovery and compressed sensing (Q5415473) (← links)
- Logic-based Benders decomposition for wildfire suppression (Q6068720) (← links)
- Combining optimisation and simulation using logic-based Benders decomposition (Q6087478) (← links)
