Liniał drewniany, metalowy.
Liniał z podziałką centymetrową.
Słownik języka polskiego . 2013.
liniał — {{/stl 13}}{{stl 7}}[wym. lińjał] {{/stl 7}}{{stl 8}}rz. mnż I, D. u, Mc. liniałale, {{/stl 8}}{{stl 7}}to samo co linia w zn. 7. {{/stl 7}} … Langenscheidt Polski wyjaśnień
Nati Linial — Nathan (Nati) Linial (born 1953 in Haifa, Israel)[1] is an Israeli mathematician and computer scientist, a professor in the Rachel and Selim Benin School of Computer Science and Engineering at the Hebrew University of Jerusalem,[2] and an ISI… … Wikipedia
Isoperimetric inequality — The isoperimetric inequality is a geometric inequality involving the square of the circumference of a closed curve in the plane and the area of a plane region it encloses, as well as its various generalizations. Isoperimetric literally means… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal … Wikipedia
Semidefinite embedding — (SDE) or maximum variance unfolding (MVU) is an algorithm in computer science, that uses semidefinite programming to perform non linear dimensionality reduction of high dimensional vectorial input data. Non linear dimensionality reduction… … Wikipedia
Metrical task systems — (MTS) are abstract models for competitive analysis of online computation. Metrical task systems play roles in online problems such as paging, list accessing, and the k server problem (in finite spaces). Metrical task systems were formulated by… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia
Metrical task system — Metrical task systems (MTS) are abstract models for competitive analysis of online computation. Metrical task systems play roles in online problems such as paging, list accessing, and the k server problem (in finite spaces). Metrical task systems … Wikipedia
Expander graph — In combinatorics, an expander graph is a sparse graph which has high connectivity properties, quantified using vertex or edge expansion as described below. Expander constructions have spawned research in pure and applied mathematics, with several … Wikipedia
