147 search results - page 3 / 30 » The Computational Complexity of Quantified Reciprocals |
CATS
2007
13 years 8 months ago
2007
A model for the problem of predicting the outputs of a process, based only on knowledge of previous outputs, is proposed in terms of a decision problem. The strength of this parti...
ECAL
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We quantify the local information dynamics at each spatiotemporal point in a complex system in terms of each element of computation: information storage, transfer and mod...
CASC
2009
Springer
13 years 8 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
IPPS
2003
IEEE
14 years 21 days ago
2003
IEEE
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...