M

meal served on tray -

at most - co najwyżej

make out - zrozumieć

by all means - oczywiście

mathematical foundation - podstawa matematyczna

is indicated by the numerals in the margin -

by minimizing over them we obtain - minimalizując po nich otrzymujemy

no more than -

# may or may not be a ... -

most recently being scaned  -

is much less - jest dużo mniejszy

It should be borne in mind  - należy pamiętać

# makes use of  #  - # robi użytek z #, wykorzystuje

the main contribution of this paper is the demonstration that -

..., to mention just a few examples  - , że wymienię zaledwie kilka  przykładów

melt - topnieć, rozpuszczać się

manifold applications - różnorodne zastosowania

make up - stanowić, tworzyć

the other elements make up  the remaining 2% -

mainly - przede wszystkim

#1 is the mirror image of #2 -

no matter what  (how , where)  - niezależnie od

as a matter of fact - ściśle powiedziane

more or less - mniej więcej

exploring a  maze - badanie labiryntu

minima - minima

monic - wielomian jednej zmiennej

its worst case time is on order of magnitude  faster than -

We can write a  control abstraction which mirrors the way -

we need to make an assumption on the bounding functions -

multiset in which some elements may appear more than once

The following assumptions are made -

However, if..., the problem is more manageable -

.., if, when reading, one systematically substitutes set inclusions (or set membership, whichever makes sense) for equal signs.

running  time as measured by the number of nodes in ... -

minus sign -

The prefix "multi" indicates a reference to the multigraph; its absence indicates a reference to the underlying graph.

This paper makes a different approach

The computational results are even comparable when this algorithm is run on SUN-3 workstation while others were run on mainframes such as IBM 3081, CDC 7600 and so on.

... procedures that are quite efficient for problems of moderate size -

the mid 1960's - połowa lat 60-tych

a minor modification to the algorithm renders it strongly polynomial -

Can the general problem be solved in strongly polynomial time ? Many think not -

... indices  being read modulo n -

... when G is missing j or fewer edges.

One of the most well studied graph theoretic problems is...

Research on local search methods has only gained momentum relatively recently. - Badania związane z metodami lokalnego sąsiedztwa nabrały rozpędu stosunkowo niedawno.