128 search results - page 3 / 26 » An Implicit Characterization of PSPACE |
IANDC
2008
14 years 10 months ago
2008
We introduce two resource-bounded Baire category notions on small complexity classes such as P, QUASIPOLY, SUBEXP and PSPACE and on probabilistic classes such as BPP, which differ...
CSR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
CSL
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
JUCS
2007
14 years 10 months ago
2007
: In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from ...
NA
2010
14 years 4 months ago
2010
We investigate the stability and convergence of an implicit box scheme for subsonic flows modelled by scalar conservation laws with dissipative and possibly stiff source terms. The...