The following pages link to Monroe M. Newborn (Q1354040):
Displaying 21 items.
- (Q1138000) (redirect page) (← links)
- (Q1238627) (redirect page) (← links)
- The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores (Q1238628) (← links)
- Heuristics used by HERBY for semantic tree theorem proving (Q1277339) (← links)
- An upper bound on the time complexity of iterative-deepening-\(A^*\) (Q1354042) (← links)
- The practicality of generating semantic trees for proofs of unsatisfiability (Q2710799) (← links)
- Unsynchronized iteratively deepening parallel alpha-beta search (Q3809315) (← links)
- (Q3911404) (← links)
- Placing Counters to Illustrate Burnside's Lemma (Q3937407) (← links)
- (Q4050521) (← links)
- (Q4109264) (← links)
- (Q4128427) (← links)
- A Study of Trigger Machines (Q4401330) (← links)
- Gimpel's Reduction Technique Extended to the Covering Problem with Costs (Q5528148) (← links)
- Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines (Q5541345) (← links)
- A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines (Q5566526) (← links)
- Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits (Q5633927) (← links)
- (Q5639642) (← links)
- The Simplification of Sequential Machines with Input Restrictions (Q5659473) (← links)
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\) (Q5904318) (← links)
- Optimal crossing-free Hamiltonian circuit drawings of \(K_n\) (Q5905997) (← links)
