The following pages link to (Q4349101):
Displaying 16 items.
- Quantum computation with coherent spin states and the close Hadamard problem (Q291464) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- Variability-based model transformation: formal foundation and application (Q682373) (← links)
- Geometric stable roommates (Q976079) (← links)
- Tighter constant-factor time hierarchies (Q1014389) (← links)
- The constrained longest common subsequence problem (Q1029006) (← links)
- An algebraic representation of graphs and applications to graph enumeration (Q1953661) (← links)
- A program for sequential allocation of three Bernoulli populations (Q1978413) (← links)
- Obtaining splits from cut sets of tight spans (Q2446320) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
- Comparison of metaheuristics for the bilevel facility location and mill pricing problem (Q3186830) (← links)
- Distributed Disaster Disclosure (Q3512463) (← links)
- Combinatorics of 1-particle irreducible n-point functions via coalgebra in quantum field theory (Q5253689) (← links)
- A set of connection network synthesis based on the linear Diophantine constraints solution in area {0,1} (Q5500393) (← links)
- Space efficient algorithms for the Burrows-Wheeler backtransformation (Q5961973) (← links)
