Results 201 to 210 of about 20,803 (249)

The Lexicographically First Topologicai Order Problem is NLOG-Complete

, 1988
Takayoshi Shoudai, 隆義 正代
openalex   +1 more source

On maximal order type of the lexicographic product

Isa Vialard
openalex   +1 more source

Fast, parallel, and cache-friendly suffix array construction. [PDF]

Algorithms Mol Biol
Khan J, Rubel T, Molloy E, Dhulipala L, Patro R.   +4 more
europepmc   +1 more source

Disruption, transformation and silos: medical humanities and the management gurus. [PDF]

Med Humanit
Miller G.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Learning lexicographic orders

European Journal of Operational Research, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dombi, József, Imreh, Csanád, Vincze, Nándor   +2 more
openaire   +1 more source

Lexicographical Order in Integer Programming

Vietnam Journal of Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Labbé, Martine, Marín, Alfredo, Rodríguez-Chía, Antonio   +2 more
openaire   +3 more sources

Randić index and lexicographic order

Journal of Mathematical Chemistry, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Araujo, Oswaldo, Rada, Juan
openaire   +1 more source

Iterative Lexicographic Path Orders

2006
We relate Kamin and Levy’s original presentation of lexicographic path orders (LPO), using an inductive definition, to a presentation, which we will refer to as iterative lexicographic path orders (ILPO), based on Bergstra and Klop’s definition of recursive path orders by way of an auxiliary term rewriting sytem.
Klop, J.W., Oostrom, V. van, Vrijer, R.C. de   +2 more
openaire   +5 more sources