Skip to search formSkip to main contentSkip to account menu

Simplexity

Simplexity is an emerging theory that proposes a possible complementary relationship between complexity and simplicity. The term draws from General… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Analysis of algorithmsAndrei BroderChaos theoryComplex systems

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Exploring the notion of situation for responsive manufacturing systems specification issues
2017
2017
Intelligent Human Computer Interaction
The international conference on Intelligent Human Computer Interaction (IHCI) is a forum for the presentation of research results… 
2016
2016
Einstein's Dark Energy via Similarity Equivalence, 'tHooft Dimensional Regularization and Lie Symmetry Groups
Realizing the physical reality of ‘tHooft’s self similar and dimensionaly regularized fractal-like spacetime as well as being… 
2016
2016
Simplexity (and Complicity) in Architecture
The paper examines the interplay between simple and complex in contemporary architecture. It discusses how complex-looking… 
2014
2014
Théorie de la Saillance Submorphologique et neurosciences cognitives
Nous explorons actuellement un protocole methodologique que nous nommons la " Theorie de la Saillance Submorphologique " (TSS… 
2014
2014
On a non-commutative analogue of a classical result of Namioka and Phelps
2013
2013
Intersections and coincidences in chemical kinetics: Linear two-step reversible-irreversible reaction mechanism
Highly Cited
2012
Highly Cited
2012
Simplexity: Simplifying Principles for a Complex World
In this book a noted physiologist and neuroscientist introduces the concept of simplexity, the set of solutions living organisms… 
2012
2012
There are only two nonobtuse binary triangulations of the unit n-cube
2000
2000
A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes
  • Warren D. Smith
  • European journal of combinatorics (Print)
  • 2000
  • Corpus ID: 2805264
Let T(n) denote the number of n -simplices in a minimum cardinality decomposition of the n -cube into n -simplices. For n? 1, we… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)