The following pages link to Herbert S. Shank (Q1074590):
Displaying 25 items.
- The Gauss code problem off the plane (Q1074591) (← links)
- (Q1135901) (redirect page) (← links)
- The rational case of a matrix problem of Harrison (Q1135902) (← links)
- On the functional equation \(f(x)=\sum^{k-1}_{j=0}f((x+j)/k)\) over finite rings. (Q1228744) (← links)
- Analogs of Bernoulli polynomials in fields \(\mathbb{Z}_p\) (Q1232547) (← links)
- Full 4-colorings of 4-regular maps (Q3048854) (← links)
- An Algebraic Proof of Kirchhoff's Network Theorem (Q3285873) (← links)
- The cycle space of an embedded graph (Q3338270) (← links)
- Defining Bernoulli Polynomials in Z/pZ (A Generic Regularity Condition) (Q3469160) (← links)
- (Q3680853) (← links)
- Edge‐disjoint spanning trees: A connectedness theorem (Q3708038) (← links)
- (Q3872484) (← links)
- (Q3933010) (← links)
- (Q3950573) (← links)
- Clique coverings of graphs V: maximal-clique partitions (Q3967566) (← links)
- (Q4063182) (← links)
- (Q4074926) (← links)
- On the Recognition of Primes by Automata (Q5548359) (← links)
- Two memory bounds for the recognition of primes by automata (Q5563369) (← links)
- Two memory bounds for the recognition of primes by automata (Q5569461) (← links)
- (Q5574712) (← links)
- Records of turing machines (Q5616139) (← links)
- Graph property recognition machines (Q5616161) (← links)
- On the undecidability of finite planar graphs (Q5626646) (← links)
- On the undecidability of finite planar cubic graphs (Q5686031) (← links)
