Merge branch 'master' of https://github.com/shrinivaasanka/Krishna_iR…

…esearch_DoxygenDocs Updated NeuronRain FAQ - http://neuronrain-documentation.readthedocs.io/en/latest/ Conflicts: index.rst
shrinivaasanka · May 3, 2018 · 0e13d3f · 0e13d3f
2 parents c8f0b56 + 761dce2
commit 0e13d3f
Show file tree

Hide file tree

Showing 7 changed files with 1 addition and 1 deletion.
diff --git a/Krishna_iResearch_Intelligent_Cloud_Platform_Products_Design.odt b/Krishna_iResearch_Intelligent_Cloud_Platform_Products_Design.odt
diff --git a/Krishna_iResearch_Intelligent_Cloud_Platform_Products_Design.pdf b/Krishna_iResearch_Intelligent_Cloud_Platform_Products_Design.pdf
diff --git a/Krishna_iResearch_opensourceproducts_archdiagram.pdf b/Krishna_iResearch_opensourceproducts_archdiagram.pdf
diff --git a/NeuronRain_Architecture_Diagrams_29September2016.pdf b/NeuronRain_Architecture_Diagrams_29September2016.pdf
diff --git a/ProductOwnerProfile_With_FunctionalityDescription.pdf b/ProductOwnerProfile_With_FunctionalityDescription.pdf
diff --git a/README.md b/README.md
diff --git a/index.rst b/index.rst
@@ -187,7 +187,7 @@ Following are the conceptual relations between various draft publications in a n
 	3. Factorization has a Diophantine Representation (Pell Equation)
 	4. Tiling/Filling/Packing is a generalization of Complement Functions (Exact Cover)
 	5. Majority Function has a Tabulation Hashing definition (e.g Electronic Voting Machines) i.e Hash table of candidates as keys and votes per candidate as chained buckets 
-	6. Integer Partitions and Tabulation Hashing are isomorphic e.g partition of an integer 21 as 5+2+3+4+5+2 and Hash table of 21 values partitioned by keys on bucket chains of sizes 5,2,3,4,5,2 are bijective. Both Set Partitons and Hash tables are exact covers quantified by Bell Numbers/Stirling Numbers. Partitions/Hashing is a special case of Multiple Agent Resource Allocation problem.
+	6. Integer Partitions and Tabulation Hashing are isomorphic e.g partition of an integer 21 as 5+2+3+4+5+2 and Hash table of 21 values partitioned by keys on bucket chains of sizes 5,2,3,4,5,2 are bijective. Both Set Partitons and Hash tables are exact covers quantified by Bell Numbers/Stirling Numbers. Partitions/Hashing is a special case of Multiple Agent Resource Allocation problem. Thus hash tables and partitions create complementary sets defined by Diophantine equations.
 	7. Ramsey Coloring and Complementation are equivalent
 	8. Graph representation of Texts and Lambda Function Composition are Formal Language and Algorithmic Graph Theory Models e.g parenthesization of a sentence creates a Lambda Function Composition Tree of Part-of-Speech.
 	9. Majority Function - Voter SAT is a Boolean Function Composition Problem