query: Applying Reduce[] to a table
positive_passages.docid: 147837
positive_passages.text: Find the parameter values satisfying conditions for all roots of an equation
negative_passages.docid: 53689
negative_passages.text: Filtering out duplicated/non-unique rows in data.table
negative_passages.docid: 53855
negative_passages.text: using underscore's “difference” method on arrays of objects
negative_passages.docid: 36330
negative_passages.text: Map a function over the columns of an M x N array
negative_passages.docid: 150060
negative_passages.text: Determining duplicates in a datatable
negative_passages.docid: 108185
negative_passages.text: How to diagonally divide a table cell … adaptation?
negative_passages.docid: 149256
negative_passages.text: Using data.table to aggregate
negative_passages.docid: 84498
negative_passages.text: Accessing Reduce from DSolve
negative_passages.docid: 88678
negative_passages.text: Optimize table layout
negative_passages.docid: 16091
negative_passages.text: What is the most efficient/elegant way to parse a flat table into a tree?
negative_passages.docid: 96461
negative_passages.text: How to write an algorithm as a column inside the table
negative_passages.docid: 122385
negative_passages.text: Floating point arithmetic operations when row reducing matrices
negative_passages.docid: 54588
negative_passages.text: Replacing all values in a table > $T$
negative_passages.docid: 79081
negative_passages.text: Table with actions per row
negative_passages.docid: 16754
negative_passages.text: Can I bind an array to an IN() condition?
negative_passages.docid: 60824
negative_passages.text: Data Table Manipulation in Mathematica
negative_passages.docid: 36864
negative_passages.text: How should I iterate over a sparse array in index order?