The following pages link to (Q3777423):
Displaying 15 items.
- Minimal faithful upper-triangular matrix representations for solvable Lie algebras (Q507889) (← links)
- A fixed point operator for the generalised maximum satisfiability problem (Q689970) (← links)
- The maximum clique problem (Q1318271) (← links)
- Lower bounds for constant degree independent sets (Q1322210) (← links)
- Origins of the analysis of the Euclidean algorithm (Q1344935) (← links)
- The hidden algorithm of Ore's theorem on Hamiltonian cycles (Q1388983) (← links)
- A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
- Algorithmic method to obtain combinatorial structures associated with Leibniz algebras (Q2228805) (← links)
- An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling (Q2365172) (← links)
- The travelling salesman problem: selected algorithms and heuristics† (Q3033569) (← links)
- On the rapid computation of various polylogarithmic constants (Q3127345) (← links)
- Algorithmic procedure to compute abelian subalgebras and ideals of maximal dimension of Leibniz algebras (Q3451398) (← links)
- On CLIQUE Problem for Sparse Graphs of Large Dimension (Q3463541) (← links)
- Oriented CW complexes and finite‐dimensional alternative algebras (Q6087608) (← links)
- Computing the Tutte polynomial of a graph of moderate size (Q6487966) (← links)
