2016-03-232016-03-2320099788461328369http://hdl.handle.net/11441/38945Spiking neural P systems were proved to be Turing complete as function computing or number generating devices. Moreover, it has been considered in several papers that spiking neural P systems are also computationally efficient devices working in a non-deterministic way or with exponential pre-computed resources. In this paper, neuron budding rules are introduced in the framework of spiking neural P systems, which is biologically inspired by the growth of dendritic tree of neuron. Using neuron budding rules in SN P systems is a way to trade space for time to solve computational intractable problems. The approach is examined here with a deterministic and polynomial time solution to sat problem without using exponential pre-computed resources.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/openAccesshttps://idus.us.es/xmlui/handle/11441/38945