Algebra

Results: 27786



#Item
951MBS Technical ReportOn Replacing “Quantum Thinking” with Counterfactual Reasoning1 Louis Narens Department of Cognitive Sciences

MBS Technical ReportOn Replacing “Quantum Thinking” with Counterfactual Reasoning1 Louis Narens Department of Cognitive Sciences

Add to Reading List

Source URL: www.imbs.uci.edu

Language: English - Date: 2015-06-17 18:14:51
952Structural Recursion as a Query Language y Val Breazu-Tannen, Peter Buneman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104{6389, USA val, peter @cis.upenn.edu

Structural Recursion as a Query Language y Val Breazu-Tannen, Peter Buneman Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104{6389, USA val, peter @cis.upenn.edu

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2006-12-31 07:06:16
953217 Documenta Math. Stable Maps of Curves Robert F. Coleman

217 Documenta Math. Stable Maps of Curves Robert F. Coleman

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2003-12-22 16:28:30
954PSBLAS 2.4 & MLD2P4 1.2: Sparse Computations and Iterative Solvers on Parallel Computers PSBLAS 2.4 &

PSBLAS 2.4 & MLD2P4 1.2: Sparse Computations and Iterative Solvers on Parallel Computers PSBLAS 2.4 &

Add to Reading List

Source URL: people.uniroma2.it

Language: English - Date: 2014-10-09 08:41:31
955EE103/CME103: Introduction to Matrix Methods OctoberS. Boyd Midterm Exam

EE103/CME103: Introduction to Matrix Methods OctoberS. Boyd Midterm Exam

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-10-22 14:39:52
956Assignment 4 Randomization in Numerical Linear Algebra (PCMI) 1. We will prove a structural inequality that can be used as a starting point in many RandNLA algorithms. More specifically, we will prove the following lemma

Assignment 4 Randomization in Numerical Linear Algebra (PCMI) 1. We will prove a structural inequality that can be used as a starting point in many RandNLA algorithms. More specifically, we will prove the following lemma

Add to Reading List

Source URL: www.drineas.org

Language: English - Date: 2016-07-02 06:19:59
957CS:APP Web Aside DATA:BOOL: More on Boolean Algebra and Boolean Rings∗ Randal E. Bryant David R. O’Hallaron June 5, 2012

CS:APP Web Aside DATA:BOOL: More on Boolean Algebra and Boolean Rings∗ Randal E. Bryant David R. O’Hallaron June 5, 2012

Add to Reading List

Source URL: csapp.cs.cmu.edu

Language: English - Date: 2012-06-05 05:37:34
958Exact Corotational Linear FEM Stiffness Matrix Jernej Barbiˇc Technical Report, University of Southern California, 2012 9 × 12 matrices. In Equation 3, we need the term ∂ R/∂ x` , which is the `-th column of ∂ R/

Exact Corotational Linear FEM Stiffness Matrix Jernej Barbiˇc Technical Report, University of Southern California, 2012 9 × 12 matrices. In Equation 3, we need the term ∂ R/∂ x` , which is the `-th column of ∂ R/

Add to Reading List

Source URL: www-bcf.usc.edu

Language: English - Date: 2012-08-04 10:10:49
959This text is based on classes given in Spring 2015 Jerusalem and in Spring 2016 in Paris on globally valued fields, aiming to prove the existential closure of k(a)alg , and concentrating on the algebraic geometry needed

This text is based on classes given in Spring 2015 Jerusalem and in Spring 2016 in Paris on globally valued fields, aiming to prove the existential closure of k(a)alg , and concentrating on the algebraic geometry needed

Add to Reading List

Source URL: math.huji.ac.il

Language: English - Date: 2016-03-16 08:14:12
960131 Documenta Math. Degeneration of Polylogarithms and Special Values of L-Functions for Totally Real Fields

131 Documenta Math. Degeneration of Polylogarithms and Special Values of L-Functions for Totally Real Fields

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2009-02-25 10:07:03