Theorem - PDFSEARCH.IO - Document Search Engine

Theorem
Results: 6939

#	Item
421	Panofsky-Wenzel Theorem Classical Mechanics and Electromagnetism for Accelerators USPAS 2013 Gabriel Marcus June 23, 2013 Add to Reading List Source URL: laser.lbl.gov Language: English - Date: 2016-02-02 15:38:14 Electromagnetism Lorentz force Physics Complex analysis Operator theory Differential forms
422	Speculative Attacks and Financial Architecture: Experimental Analysis of Coordination Games with Public and Private Information* Frank Heinemanna, Rosemarie Nagelb and Peter Ockenfelsc First version 7. August 2001. Add to Reading List Source URL: www.macroeconomics.tu-berlin.de Language: English - Date: 2011-04-12 09:46:06 Game theory Non-cooperative games Nash equilibrium Risk dominance Best response Strategy Solution concept Coordination game Bayesian game Folk theorem
423	CENTER FOR LABOR ECONOMICS UNIVERSITY OF CALIFORNIA, BERKELEY WORKING PAPER NO. 50 Are Politicians Accountable to Voters? Evidence from U.S. House Roll Call Voting Records * Add to Reading List Source URL: cle.berkeley.edu Language: English - Date: 2002-04-08 13:40:01 Political philosophy Politics Public choice theory Voting Voting theory Elections Psephology Median voter theorem Voting system Electronic voting Voting behavior
424	671 Documenta Math. Cancellation Theorem Vladimir Voevodsky Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2010-06-21 15:52:41 Algebra Abstract algebra Mathematics Algebraic geometry Divisor Morphism of algebraic varieties Flat morphism Finite morphism Cohomology Triangulated category Motive Ring
425	Theorem 1. If F (n) is the number of Friedman numbers in the range [1, n], then lim F (n)/n = 1. n→∞ In order to prove this claim, we begin by defining a class of integers that will be used throughout the proof. Add to Reading List Source URL: www2.stetson.edu Language: English - Date: 2010-06-20 20:24:24 Mathematics Discrete mathematics Combinatorics Friedman number Factorial Permutation Integer Combination Pi Transposable integer Harshad number
426	ABOUT MANUSCRIPTS FOR IJ ITA Add to Reading List Source URL: foibg.com Language: English - Date: 2015-02-02 08:46:59 Logic Abstraction Mathematical logic Automated theorem proving Artificial intelligence Reasoning Theoretical computer science Logic in computer science Reasoning system First-order logic Automated reasoning Modal logic
427	Proof Assistants and the Dynamic Nature of Formal Theories Robert L. Constable Cornell University Abstract Add to Reading List Source URL: dream.inf.ed.ac.uk Language: English - Date: 2012-06-04 13:35:50 Mathematical logic Logic Automated theorem proving Proof assistants Theoretical computer science Logic in computer science Abstraction Nuprl Constructivism Type theory Mathematical proof Robert Lee Constable
428	Math. Ann. 262, Springer-Verlag 1983 Oscillations of Fourier Coefficients of Modular Forms M. Ram Murty Department of Mathematics. McGill University. 805 Sherbrooke Street, W., Montreal P.Q. Canada Add to Reading List Source URL: www.mast.queensu.ca Language: English - Date: 2013-08-08 16:47:30 Mathematics Mathematical analysis Algebra Analytic number theory Joseph Fourier Modular forms Fourier series Elliptic curve Field theory RamanujanPetersson conjecture Fundamental theorem of algebra Fourier transform
429	Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials : One Theorem for all . Leonid Gurvits∗ November 20, 2007 Add to Reading List Source URL: www.cargo.wlu.ca Language: English - Date: 2008-09-16 05:27:41 Algebra Mathematics Polynomial Homogeneous polynomial Permanent
430	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity

UPDATE