B
to aim at bringing together - dążyć do zetknięcia się
on behalf of - z ramienia
at the back - z tytułu (np. strony)
because of - z powodu
begin with a graph G - zaczynać od grafu G
begin by analyzing graph G -
bring out - wyjaśnić
the bound of n-1 on the number -
by a ... we mean a ... -
both - zarówno, oba
both of - oba z
The effect of adding the ...was significantly beneficial -
backtracking algorithm - algorytm powracający (z nawrotami)
to begin with - najpierw
bearing in mind - pamiętając, że
By arguing as in Case 1, we... -
bubble - nierealny projekt, wrzeć
methods brought to bear on ... - metody zastosowane do ...
this is because - jest tak dlatego, że ...
The Sun is belived to be mostly made up of hydrogen. - Uważa się, że słońce jest głównie złożone z H.
broken down into - rozłożony na
for brevity we ... - dla prostoty
The bounds in # are the best possible in the sense that there exist graphs for which the bounds can be attained. In most cases, however, then are too loose to be of practical significance.
All logarithms in this paper will be to base 2 -
(or, more briefly, a maximum matching) -
First we show that the bound is attainable for sufficiently large n. -
By an assignment we shall mean any one-to-one map a(.) ... of I into -
for the bulk of the paper -
binary choice - wybór dychotomiczny
bounding from below -
# is bounded below by some positive constant -
# is bounded above by ... -
# bears on - # dotyczy
SLF has very bad behavior -
bar - kreska (przy literze)
Listed below is a sample set of ... –
Listed below is a sample set of ... –
Thousands of people have been unable to experience its (FORTRAN) benefits. -
Below that is the tree which is generated by procedure MCOL. -
The algorithm may be speeded a bit by ... -
b-ary tree -
our algorithm brings an improvement -
Random graphs should be a significant component of any benchmark for measuring coloring algorithm performance both in computation time and in terms of accurancy of estimation of the chromatic number by heuristic coloring algorithms.
by-product - efekt uzyskiwany przy okazji
benchmark - punkt odniesienia
In broad terms, ... -
In a broad sense, ... -
Since slight perturbations of the general problem seem to send it across the boundary between P and NP-complete, it is of interest to know just how far one can push the version which is polynomial while having it remain polynomial
backslash = "\"
begins with 97980 and ends in 1. -
A "good" characterization for 3-colorability seems beyond hope. -
The theorem below is proven by a rather complicated manipulation ..., but the intuitions behind the proof are rather simple.
In this paper we continue this research, exploring the border between polynomial time solvability and NP-completeness for ... problems. -
As usual, the tree itself can be recovered by using "back pointers", i.e. by retaining a record of the minimizing choices of ... -
... were generated based on ... - ( a nie "basing on" )
bisection search over L -
An actual bout with the computer can often save many hours of desk analysis
corner brackets ⌊ ⌋ ⌈ ⌉
braces { }
square brackets [ ]
parentheses ( )
angle brackets < >
