|
Volumn , Issue , 2013, Pages
|
Fiber non-Turing all-optical computer for solving complex decision problems
|
Author keywords
[No Author keywords available]
|
Indexed keywords
ALGORITHMS;
COMPLEX NETWORKS;
COMPUTATIONAL COMPLEXITY;
ELECTRON OPTICS;
OPTICAL DATA PROCESSING;
POLYNOMIAL APPROXIMATION;
QUANTUM COMPUTERS;
QUANTUM ELECTRONICS;
TRAVELING SALESMAN PROBLEM;
TURING MACHINES;
COMPLETE PROBLEMS;
CONVENTIONAL APPROACH;
DIRECTED HAMILTONIAN PATH PROBLEMS;
ELECTRONIC COMPUTERS;
MATHEMATICAL COMPLEXITY;
NONDETERMINISTIC POLYNOMIAL;
PROOF OF PRINCIPLES;
TRAVELLING SALESMAN PROBLEM;
PROBLEM SOLVING;
|
EID: 84900318944
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/CLEOE-IQEC.2013.6801271 Document Type: Conference Paper |
Times cited : (3)
|
References (0)
|