The following pages link to Krasimir Yordzhev (Q273282):
Displaying 22 items.
- Factor-set of binary matrices and Fibonacci numbers (Q273283) (← links)
- Calculation of the number of all pairs of disjoint S-permutation matrices (Q670673) (← links)
- (Q1842430) (redirect page) (← links)
- An \(n^2\) algorithm for recognition of context-free languages (Q1842431) (← links)
- Bipartite graphs related to mutually disjoint \(S\)-permutation matrices (Q1935979) (← links)
- On the number of mutually disjoint pairs of \(S\)-permutation matrices (Q2400583) (← links)
- On the cardinality of a factor set of binary matrices (Q2406405) (← links)
- On the number of disjoint pairs of S-permutation matrices (Q2446899) (← links)
- On the probability of two randomly generated \(S\)-permutation matrices to be disjoint (Q2453992) (← links)
- On the cardinality of a factor set in the symmetric group (Q2920902) (← links)
- (Q2956432) (← links)
- (Q3126202) (← links)
- Semi-canonical binary matrices (Q3456077) (← links)
- (Q3715164) (← links)
- (Q4874801) (← links)
- Calculating the cardinality of some classes of binary matrices using bitwise operations — A polynomial algorithm (Q4968285) (← links)
- On an algorithm for receiving Sudoku matrices (Q5367532) (← links)
- (Q5416279) (← links)
- Bitwise operations related to a combinatorial problem on binary matrices (Q6238938) (← links)
- On an Algorithm for Obtaining All Binary Matrices of Special Class Related to V. E. Tarakanov's Formula (Q6246905) (← links)
- Canonical matrices with entries integers modulo p (Q6374147) (← links)
- On some randomized algorithms and their evaluation (Q6739788) (← links)