Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=499
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The ARNN model relativises
P=NP
and
P\neq NP
José Félix Costa
,
Raimundo Leong
Theoretical Computer Science
499
, pp. 2-22
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Eugen Czeizler
,
Alexandru Popa
Theoretical Computer Science
499
, pp. 23-37
State complexity of star of union and square of union on
k
regular languages
Yuan Gao
,
Lila Kari
Theoretical Computer Science
499
, pp. 38-50
Enumeration approach to computing chemical equilibria
Satoshi Kobayashi
Theoretical Computer Science
499
, pp. 51-87
Universality of sequential spiking neural P systems based on minimum spike number
Keqin Jiang
,
Tao Song
,
Linqiang Pan
Theoretical Computer Science
499
, pp. 88-97
State succinctness of two-way finite automata with quantum and classical states
Shenggen Zheng
,
Daowen Qiu
,
Jozef Gruska
,
Lvzhou Li
,
Paulo Mateus
Theoretical Computer Science
499
, pp. 98-112
A note on the
\epsilon
-indicator subset selection
Daniel Vaz
,
Luís Paquete
,
Aníbal Ponte
Theoretical Computer Science
499
, pp. 113-116