Computing the complexity for Schelling segregation models
From MaRDI portal
Publication:718797
DOI10.1016/J.CNSNS.2007.04.023zbMATH Open1221.37185OpenAlexW2074222073MaRDI QIDQ718797FDOQ718797
Carsten Schneider, Stefan Gerhold, Lev Glebsky, Howard Weiss, Burkhard Zimmermann
Publication date: 24 September 2011
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cnsns.2007.04.023
Cites Work
- Title not available (Why is that?)
- GFUN
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- Singularity Analysis of Generating Functions
- Dynamic models of segregation†
- The method of creative telescoping
- The dynamics of Schelling-type segregation models and a nonlinear graph Laplacian variational problem
Cited In (5)
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On the complexity of polyhedral separability 👍 👎
- Computation Models for Parameterized Complexity 👍 👎
- Complexity estimates for the Schmüdgen Positivstellensatz 👍 👎
- Complexity of Ehrenfeucht models 👍 👎
- Complexity of compartmental models 👍 👎
- The complexity of stratification computation 👍 👎
- Revisiting separation: Algorithms and complexity 👍 👎
This page was built for publication: Computing the complexity for Schelling segregation models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q718797)