Numerical approximation of the Ginzburg-Landau equation with memory effects in the dynamics of phase transitions.
N. C. Cassol-SeewaldM. I. M. CopettiGastao KreinPublished in: Comput. Phys. Commun. (2008)
Keyphrases
- phase transition
- constraint satisfaction
- random constraint satisfaction problems
- randomly generated
- np complete
- satisfiability problem
- graph coloring
- combinatorial problems
- dynamical systems
- hard problems
- memory requirements
- np complete problems
- random graphs
- random instances
- sat problem
- memory usage
- lower bound
- memory space
- reinforcement learning
- special case
- description logics
- orders of magnitude