reducible path

reducible path
мат. приводимый путь

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем сделать НИР

Смотреть что такое "reducible path" в других словарях:

  • Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… …   Wikipedia

  • Four color theorem — Example of a four colored map A four colori …   Wikipedia

  • Logicism — is one of the schools of thought in the philosophy of mathematics, putting forth the theory that mathematics is an extension of logic and therefore some or all mathematics is reducible to logic.[1] Bertrand Russell and Alfred North Whitehead… …   Wikipedia

  • Peirce, Charles Sanders — American pragmatism Peirce Cheryl Misak INTRODUCTION Charles Sanders Peirce (1839–1914), one of America’s greatest philosophers, mathematicians, and logicians, was a difficult and not altogether pleasant character. That, combined with what the… …   History of philosophy

  • Hermeneutics — Gadamer and Ricoeur G.B.Madison THE HISTORICAL BACKGROUND: ROMANTIC HERMENEUTICS Although the term ‘hermeneutics’ (hermeneutica) is, in its current usage, of early modern origin,1 the practice it refers to is as old as western civilization itself …   History of philosophy

  • History of Physics —     History of Physics     † Catholic Encyclopedia ► History of Physics     The subject will be treated under the following heads: I. A Glance at Ancient Physics; II. Science and Early Christian Scholars; III. A Glance at Arabian Physics; IV.… …   Catholic encyclopedia

  • SL (complexity) — In computational complexity theory, SL (Symmetric Logspace or Sym L) is the complexity class of problems log space reducible to USTCON ( undirected s t connectivity ), which is the problem of determining whether there exists a path between two… …   Wikipedia

  • PA degree — In recursion theory, a mathematical discipline, a PA degree is a Turing degree that computes a complete extension of Peano arithmetic (Jockusch 1987). These degrees are closely related to fixed point free (DNR) functions, and have been thoroughly …   Wikipedia

  • literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… …   Universalium

  • Cograph — The Turán graph T(13,4), an example of a cograph In graph theory, a cograph, or complement reducible graph, or P4 free graph, is a graph that can be generated from the single vertex graph K1 by complementation and disjoint union. That is, the… …   Wikipedia

  • Glossary of philosophical isms — This is a list of topics relating to philosophy that end in ism . compactTOC NOTOC A * Absolutism – the position that in a particular domain of thought, all statements in that domain are either absolutely true or absolutely false: none is true… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»