111 search results - page 1 / 23 » Computing with Membranes: One More Collapsing Hierarchy |
EATCS
2000
13 years 5 months ago
2000
IJFCS
2010
13 years 2 months ago
2010
We investigate the computational power of parallel models with directed reconfigurable buses and with shared memory. Based on feasibility considerations present in the literature,...
MST
2010
13 years 4 months ago
2010
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability corr...
NGC
2002
Springer
13 years 5 months ago
2002
Springer
In the attempt to have a framework where the computation is done by communication only, we consider the biological phenomenon of trans-membrane transport of couples of chemicals (o...