Sentence examples for tsp from inspiring English sources

Serves 4 liquid honey 6 tbsp thyme leaves 1½ tsp goat's cheese 150g goat's milk yogurt 500ml air-dried ham 12 thin slices Pour the honey into a small saucepan.

Serves 6 For the custard: single cream 500ml vanilla extract 1 tsp egg 5 yolks caster sugar 4 tbsp For the rhubarb: rhubarb 600g caster sugar 75g water 100ml Make the custard first.

Serves 4 180g dark chocolate (70%) 80g caster sugar 2 whole eggs 2 egg yolks 250ml double cream 30ml extra virgin olive oil, plus extra for the crostini and finishing ½ tsp flaky sea salt, plus extra for the crostini and finishing 1 small ciabatta 1 Melt the chocolate in a bowl over simmering water and remove from the heat.

Serves 2 1 tbsp olive oil ½ onion, chopped 1 garlic clove, finely chopped 1 scotch bonnet chilli, deseeded and chopped (leave the seeds in if you like it very hot) 1 tsp tomato puree ½ tsp ground cumin 1 x 400g tin tomatoes 4 eggs 2 tortillas 2 tbsp sour cream 1 Heat the oil in a medium saucepan.

Customise by mixing in a few capers one day, some chopped gherkins and a tsp of wholegrain mustard the next, and some flaked smoked mackerel the final day.

Serves 20. 10 x bottle of Hall & Woodhouse pickled partridge beer or any good dark ale 5 egg yolks 5 tsp white sugar 2 tsp nutmeg 1 cinnamon stick 1 dry red chillies 10 cloves 1 tsp freshly ground nutmeg 1 tsp ground ginger Heat the beer and the spices in a large saucepan until the ground spices dissolve.

Stronger evidence can be adduced for the intractability of conjecture \(\sc{SAT}\), \(\sc{TSP}\), and \(\sc{INTEGER}\ \sc{PROGRAMMING}\) (and similarly for a great many other problems of practical interest in subjects like logic, graph theory, linear algebra, formal language theory, game theory, and combinatorics).

For instance, the completeness of \(\sc{TSP}\) was originally demonstrated by Karp (1972) via the series of reductions \[ \sc{SAT} \leq_P 3\text\sc{SAT} \leq_P \sc{INDEPENDENT}\ \sc{SET} \leq_P \sc{VERTEX}\ \sc{COVER} \leq_P \sc{HAMILTONIAN}\ \sc{PATH} \leq_P \sc{TSP}.

The problem \(\sc{TSP}\) served as a particularly important example in the early development of complexity theory.

The question thus arose whether it was possible to improve upon such algorithms further, not only for \(\sc{TSP}\), but also for other problem such as \(\sc{SAT}\) for which efficient algorithms had been sought but were not known to exist.

In order to appreciate what is at stake with this question, observe that the naive algorithm for \(\sc{TSP}\) works as follows: 1) enumerate the set \(S_G\) of all possible tours in \(G\) and compute their weights; 2) check if the cost of any of these tours is \(\leq b\).