Sciweavers

2485 search results - page 7 / 497
» Time Bounded Frequency Computations
Sort
View
FOCS
1998
IEEE
13 years 12 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
UMC
2000
13 years 11 months ago
Upper and Lower Bounds on Continuous-Time Computation
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
Manuel Lameiras Campagnolo, Cristopher Moore
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
Guillaume Chèze
MASCOTS
1994
13 years 9 months ago
Stochastic Bounds on Execution Times of Parallel Computations
Francesco Lo Presti, Michele Colajanni, Salvatore ...
EUROPAR
2005
Springer
14 years 1 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...