Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An axiomatic characterization of a fuzzy generalization of rough sets
Information Sciences—Informatics and Computer Science: An International Journal
Constructive and axiomatic approaches of fuzzy approximation operators
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
Towards solution of the set-splitting problem on gel-based DNA computing
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Theoretical and Experimental DNA Computation (Natural Computing Series)
Theoretical and Experimental DNA Computation (Natural Computing Series)
Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast parallel bio-molecular solutions: the set-basis problem
International Journal of Computational Science and Engineering
Using sticker to solve the 3-dimensional matching problem in molecular supercomputers
International Journal of High Performance Computing and Networking
Membrane systems with proteins embedded in membranes
Theoretical Computer Science
A study of particle swarm optimization particle trajectories
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
A Molecular Solution to the Three-Partition Problem
Journal of Information Technology Research
Hi-index | 0.07 |
Assume that there exists a collection C of subsets of a finite set S, and a positive integer K=