Capabilities and Complexity of Computations with Integer Division
نویسندگان
چکیده
Computation trees with operation set S f+;?; ;DIV; DIV c g (S-CTs) are considered. DIV denotes integer division, DIV c integer division by constants. We characterize the families of languages L Z Z n that can be recognized by S-CTs, separate the computational capabilities of S-CTs for diierent operation sets S, and prove lower bounds for the depth of such trees.
منابع مشابه
Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities
In this paper, we study the routing and wavelength assignment (RWA) tasks in WDM rings with heterogeneous wavelength conversion capabilities. By heterogeneous, we mean that different nodes of the WDM ring might have different wavelength conversion capabilities. An Integer Linear Programming (ILP) formulation is used to optimally solve small examples of the problem. Because many of RWA problems ...
متن کاملShort Rational Functions for Toric Algebra
We encode the binomials belonging to the toric ideal IA associated with an integral d × n matrix A using a short sum of rational functions as introduced by Barvinok (1994); Barvinok and Woods (2003). Under the assumption that d and n are fixed, this representation allows us to compute a universal Gröbner basis and the reduced Gröbner basis of the ideal IA, with respect to any term order, in tim...
متن کاملCalculating Cost Efficiency with Integer Data in the Absence of Convexity
One of the new topics in DEA is the data with integer values. In DEA classic models, it is assumed that input and output variables have real values. However, in many cases, some inputs or outputs can have integer values. Measuring cost efficiency is another method to evaluate the performance and assess the capabilities of a single decision-making unit for manufacturing current products at a min...
متن کاملUNBOUNDEDNESS IN MOILP AND ITS EFFICIENT SOLUTIONS
In this paper we investigate Multi-Objective Integer Linear Programming (MOILP) problems with unbounded feasible region and introduce recession direction for MOILP problems. Then we present necessary and sufficient conditions to have unbounded feasible region and infinite optimal values for objective functions of MOILP problems. Finally we present some examples with unbounded feasible region and fi...
متن کاملOPTIMAL RESOURCE ALLOCATION IN DEA WITH INTEGER VARIABLES
Resource allocation and optimal leveling are among the top challenges in project management. This paper presents a DEA-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. To achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all DMUs. Such as some of...
متن کامل