Sciweavers

8196 search results - page 86 / 1640
» Computational Modeling and Complexity Science
Sort
View
WG
1992
Springer
15 years 1 months ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolutionary computation and the c-value paradox
The C-value Paradox is the name given in biology to the wide variance in and often very large amount of DNA in eukaryotic genomes and the poor correlation between DNA length and p...
Sean Luke
CSR
2007
Springer
15 years 1 months ago
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
Victor Poupet
DLT
2009
14 years 7 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer