The following pages link to Merrick L. Furst (Q1090413):
Displaying 14 items.
- Computing short generator sequences (Q1090414) (← links)
- Genus distributions for two classes of graphs (Q1118607) (← links)
- (Q1330791) (redirect page) (← links)
- The expressive power of voting polynomials (Q1330793) (← links)
- Fast planning through planning graph analysis (Q1402751) (← links)
- Weakly learning DNF and characterizing statistical query learning using Fourier analysis (Q2817616) (← links)
- Parity, circuits, and the polynomial-time hierarchy (Q3318683) (← links)
- (Q3341893) (← links)
- Pseudorandom number generation and space complexity (Q3694692) (← links)
- Hierarchy for imbedding-distribution invariants of a graph (Q3784089) (← links)
- (Q3912839) (← links)
- PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS (Q3988834) (← links)
- Succinct Certificates for Almost All Subset Sum Problems (Q4207577) (← links)
- (Q4341754) (← links)
