Sciweavers

128 search results - page 1 / 26
» An Implicit Characterization of PSPACE
Sort
View
CORR
2010
Springer
48views Education» more  CORR 2010»
13 years 5 months ago
An Implicit Characterization of PSPACE
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
DNA
2006
Springer
129views Bioinformatics» more  DNA 2006»
13 years 9 months ago
P Systems with Active Membranes Characterize PSPACE
P system is a natural computing model inspired by behavior of living cells and their membranes. We show that (semi-)uniform families of P systems with active membranes can solve i...
Petr Sosík, Alfonso Rodríguez-Pat&oa...
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 7 days ago
Short quantum games characterize PSPACE
Gus Gutoski, Xiaodi Wu
POPL
2008
ACM
14 years 5 months ago
A logical account of pspace
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
APAL
2006
64views more  APAL 2006»
13 years 5 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký