![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 598
Volume 598, September 2015
- Lila Kari:
Editorial. 1
- Yun Shang, Xian Lu, Ruqian Lu:
Computing power of Turing machines in the framework of unsharp quantum logic. 2-14 - Arto Salomaa:
Applications of the Chinese remainder theorem to reaction systems with duration. 15-22 - Sepinoud Azimi
, Cristian Gratie
, Sergiu Ivanov
, Ion Petre
:
Dependency graphs and mass conservation in reaction systems. 23-39 - Maxwell Hutchinson
, Michael Widom
:
Enumeration of octagonal tilings. 40-50 - Yaoyun Shi, Xiaodi Wu:
Epsilon-net method for optimizations over separable states. 51-63 - Carlos Echegoyen, Roberto Santana, Alexander Mendiburu
, José Antonio Lozano:
Comprehensive characterization of the behaviors of estimation of distribution algorithms. 64-86 - Bogdan Aman
, Gabriel Ciobanu
:
Verification of membrane systems with delays via Petri nets with delays. 87-101 - Asja Fischer
, Christian Igel
:
A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines. 102-117 - Takwa Tlili
, Saoussen Krichen
:
On solving the double loading problem using a modified particle swarm optimization. 118-128 - Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla, Simon Perdrix:
On weak odd domination and graph-based quantum secret sharing. 129-137 - Alberto Dennunzio, Enrico Formenti
, Luca Manzoni
:
Reaction systems and extremal combinatorics properties. 138-149
- Jason Morton
, Jacob W. Turner
:
Computing the Tutte polynomial of lattice path matroids using determinantal circuits. 150-156
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.