395 search results - page 11 / 79 » Positive Versions of Polynomial Time |
JAT
2007
14 years 9 months ago
2007
We present a generalization of multiple orthogonal polynomials of type I and type II, which we call multiple orthogonal polynomials of mixed type. Some basic properties are formul...
JSC
2007
14 years 9 months ago
2007
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
JSCIC
2008
14 years 9 months ago
2008
High Mach number astrophysical jets are simulated using a positive scheme, and are compared with WENO-LF simulations. A version of the positive scheme has allowed us to simulate as...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We provide the first polynomial time algorithm for the linear version of a market equilibrium model defined by Irving Fisher in 1891, thereby partially answering an open questio...