Results for combinatorial translation from Portuguese to English

jogo simbólico combinatorial múltiplo jscm 7 pontos.
combinatorial symbolic play multiple cspm 7 points.

jogo simbólico combinatorial simples jscs 6 pontos;
simple combinatorial symbolic play scsp 6 points;

== referências ==* j. h. c. whitehead, "combinatorial homotopy.
== references =====notes======general references===* j. h. c. whitehead, "combinatorial homotopy.

* "combinatorial optimization: algorithms and complexity" (com kenneth steiglitz).
prentice-hall, 1982; second edition september 1997. greek edition* "combinatorial optimization: algorithms and complexity" (with kenneth steiglitz).

" teubner, stuttgart 1984, isbn 3-519-02068-8*"combinatorial search.
teubner, stuttgart 1984, isbn 3-519-02068-8*diskrete mathematik.

foi um dos 21 problemas originais de richard karp’s mostrados no seu trabalho de 1972 “reducibility among combinatorial problems".
it was one of richard karp's original 21 problems shown np-complete in his 1972 paper "reducibility among combinatorial problems".

como esta função foi a primeira função de mão única combinatorial completa a ser demonstrada, ela é conhecida como a "função de mão única universal".
since this function was the first combinatorial complete one-way function to be demonstrated, it is known as the "universal one-way function".

==bibliografia==*ezra miller, bernd sturmfels, "combinatorial commutative algebra", graduate texts in mathematics, vol.
==selected publications==* ezra miller, bernd sturmfels, "combinatorial commutative algebra", graduate texts in mathematics, vol.

pelo mapeamento dos conjuntos da coleção em hiperarestas, isso pode ser entendido como uma generalização natural do problema da cobertura de vértices para hipergrafos, que é muitas vezes chamado apenas de cobertura de vértices para hipergrafos e, em um contexto mais combinatorial, transversal.
by mapping the sets in the collection onto hyperedges, this can be understood as a natural generalization of the vertex cover problem to hypergraphs which is often just called vertex cover for hypergraphs and, in a more combinatorial context, transversal.

* p. erdős: on the combinatorial problems which i would most like to see solved, "combinatorica", 1(1981), 28.
*p. erdős: on the combinatorial problems which i would most like to see solved, "combinatorica", 1(1981), 28.