Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...

We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents determine whether they are the lectically first n pseudo-intents. We show that this problem is coNPhard. We thereby show that there cannot be an algorithm with a good theoretical complexity for enumerating pseudo-intents...

We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial ...

In this paper we develop a pseudo function approach to obtain relative permeabilities for the numerical simulation of three-dimensional petroleum reservoirs. This approach follows the idea of an experimental approach and combines an analytical solution technique for two-phase flow with a numerical simulation technique for cross-sectional models of these three-dimensional reservoirs. The advanta...

In this short article, we observe that the path of particle of mass $m$ moving along $mathbf{r}= mathbf{r}(t)$ under pseudo-force $mathbf{A}(t)$, $t$ denotes the time, is given by $mathbf{r}_d= int(frac{dmathbf{r}}{dt} mathbf{A}(t)) dt +mathbf{c}$. We also observe that the effective force $mathbf{F}_e$ on that particle due to pseudo-force $mathbf{A}(t)$, is given by $ mathbf{F}_e= mathbf{F} mat...