The following pages link to Valentino Crespi (Q1373309):
Displaying 8 items.
- (Q1124881) (redirect page) (← links)
- How fast can one compute the permanent of circulant matrices? (Q1124882) (← links)
- On the permanent of certain \((0,1)\) Toeplitz matrices (Q1373310) (← links)
- Analyzing permutation capability of multistage interconnection networks with colored Petri nets (Q2509234) (← links)
- Efficient Computation of the Hidden Markov Model Entropy for a Given Observation Sequence (Q3547008) (← links)
- (Q4503943) (← links)
- Exact Formulae for the Lovász Theta Function of Sparse Circulant Graphs (Q4652615) (← links)
- Learning Hidden Markov Models Using Nonnegative Matrix Factorization (Q5273649) (← links)
