The queue-read, queue-write (QRQW) parallel random access machine (PRAM) model is a shared memory model which allows concurrent reading and writing with a time cost proportional to the contention. This is designed to model currently available parallel machines more accurately than either the CRCW PRAM or EREW PRAM models. Here we present a lower bound for the problem of Linear Approximate Compa...

The string editing problem for input strings z and y consists of transforming z into y by performing a series of weighted edit operations on z of overall minimum cost. An edit operation on z can be the deletion of a symbol from z, the insertion of a symbol in z or the substitution of a symbol of z with another symbol. This problem has a well known O( Izllvl) time sequential solution [25]. We gi...

The class of n{input butterry networks is very important for the design of scalable parallel machines because of constant node degree, depth log n and the existence of routing algorithms capable of delivering n log n packets, forming a log n{relation (log n packets destined to each output), in time O(log n) with constant length buuers. Implementations however show ugly wiring. We present a meth...

This study aims to analyze the development of input and output prices, translog profit function, elasticity demand for lowland rice farming inputs in Jambi Province. The function model used is Transcendental Logarithmic (Translog) function. results show that · prices has increased significantly every year. production factors affect profitability are price seeds, TSP fertilizer, other chemical f...

A recent bivariate factorisation algorithm appeared in (Abu-Salem et al., 2004) based on the use of Newton polytopes and a generalisation of Hensel lifting. Although possessing a worst case exponential running time like the Hensel lifting algorithm, the polytope method should perform well for sparse polynomials whose Newton polytopes have very few Minkowski decompositions. A preliminary impleme...

<p style='text-indent:20px;'>We present a proof under generalization of the Riemann Hypothesis that class group algorithm Hafner and McCurley runs in expected time <inline-formula><tex-math id="M1">\begin{document}$ e^{\left(3/\sqrt{8}+o(1)\right)\sqrt{\log d\log\log d}} $\end{document}</tex-math></inline-formula> where id="M2">\begin{document}$ -d is discrimina...

We reintroduce the coded model of fault-tolerant computation in which the input and output of a computational device are treated as words in an error-correcting code. A computational device correctly computes a function in the coded model if its input and output , once decoded, are a valid input and output of the function. In the coded model, it is reasonable to hope to simulate all computation...