The following pages link to Francis Zane (Q192221):
Displaying 10 items.
- Exponential lower bounds for depth three Boolean circuits (Q1590079) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- An improved exponential-time algorithm for <i>k</i> -SAT (Q3546306) (← links)
- Dimension of Projections in Boolean Functions (Q4210227) (← links)
- (Q4471301) (← links)
- Satisfiability coding lemma (Q4484662) (← links)
- (Q4526973) (← links)
- (Q4536285) (← links)
- (Q4952674) (← links)
- Scalable network architectures using the optical transpose interconnection system (OTIS) (Q5938657) (← links)