Publication | Closed Access
NP problems are tractable in the space of cellular automata in the hyperbolic plane
54
Citations
6
References
2001
Year
Mathematical ProgrammingComputational Complexity TheoryNp ProblemsGraph TheoryCellular AutomataEngineeringAutomaton NetworkComputational ComplexityAutomaton OperationP Versus Np ProblemComputer ScienceCellular AutomatonDiscrete MathematicsCombinatorial OptimizationHyperbolic Plane
| Year | Citations | |
|---|---|---|
Page 1
Page 1