Results

Looking for more? ProQuest® Dissertations & Theses has additional dissertations and theses.
12492 open access dissertations and theses found for:
if(Automated theorem proving)  »   Refine Search
1.
Galois theory and the Hilbert Irreducibility Theorem
by Adams, Damien, M.S.  San Jose State University. 2013: 118 pages; 1541481.
2.
First order decision diagrams for decision theoretic planning
by Joshi, Saket, Ph.D.  Tufts University. 2010: 190 pages; 3427479.
3.
Formal proofs and refutations
by Alama, Jesse, Ph.D.  Stanford University. 2009: 254 pages; 3364492.
4.
5.
An explication of the Hilbert basis theorem and its relation to school mathematics
by Tse, Jasmine, M.S.  California State University, Long Beach. 2009: 66 pages; 1466156.
6.
7.
A self-verifying theorem prover
by Davis, Jared Curran, Ph.D.  The University of Texas at Austin. 2009: 554 pages; 3407549.
8.
9.
An I/O-Complexity Lower Bound for All Recursive Matrix Multiplication Algorithms by Path-Routing
by Scott, Jacob N., Ph.D.  University of California, Berkeley. 2015: 113 pages; 10086162.
10.
Generalized factorization in commutative rings with zero-divisors
by Mooney, Christopher Park, Ph.D.  The University of Iowa. 2013: 125 pages; 3595128.
11.
Coboundary theorems for collections of random variables with moment conditions
by Morrow, Steven T., Ph.D.  Indiana University. 2012: 52 pages; 3550887.
12.
New Paths from Splay to Dynamic Optimality
by Levy, Caleb Carson, Ph.D.  Princeton University. 2019: 137 pages; 13885892.
13.
The Spherical Mean Value Operators on Euclidean and Hyperbolic Spaces
by Lim, Kyung-Taek, Ph.D.  Tufts University. 2012: 120 pages; 3546361.
14.
Pebble Games and Complexity
by Chan, Siu Man, Ph.D.  University of California, Berkeley. 2013: 74 pages; 3593787.
15.
Approximation by Quantized Sums
by Molino, Van, Ph.D.  New York University. 2011: 186 pages; 3466941.
16.
Relational programming in miniKanren: Techniques, applications, and implementations
by Byrd, William E., Ph.D.  Indiana University. 2009: 296 pages; 3380156.
17.
Structural induction: Towards automatic ontology elicitation
by Silvescu, Adrian, Ph.D.  Iowa State University. 2008: 187 pages; 3307040.
18.
A modal logic for role-based access control within the HOL theorem prover
by Kosiyatrakul, Thumrongsak, Ph.D.  Syracuse University. 2010: 463 pages; 3429046.
19.
Weil-étale cohomology over local fields
by Karpuk, David A., Ph.D.  University of Maryland, College Park. 2012: 85 pages; 3517682.
20.
Learning in the presence of unawareness
by Rong, Nan, Ph.D.  Cornell University. 2016: 165 pages; 10183854.
21.
Arithmetic analogues in harmonic analysis: Results related to Waring's problem
by Hughes, Kevin J., Jr., Ph.D.  Princeton University. 2012: 112 pages; 3545733.
23.
Lagrange multipliers for set-valued functions when ordering cones have empty interior
by Tasset, Tiffany N., Ph.D.  University of Colorado at Boulder. 2010: 57 pages; 3419546.
24.
Satisfiability checking for quality assurance in relational data processing
by Heller, Kelly K., M.S.  California State University, Long Beach. 2013: 234 pages; 1524200.
25.
Some Regularity Properties for Two Equations Arising from Flows
by Chen, Eric Christopher, Ph.D.  Princeton University. 2019: 124 pages; 13885976.
27.
The Covering Numbers of Some Finite Simple Groups
by Epstein, Michael, Ph.D.  Florida Atlantic University. 2019: 105 pages; 13857989.
28.
Spectral properties of random block operators
by Chapman, Jacob W., Ph.D.  The University of Alabama at Birmingham. 2013: 166 pages; 3561259.
30.
Quantitative Embeddability and Connectivity in Metric Spaces
by Eriksson-Bique, Sylvester David, Ph.D.  New York University. 2017: 267 pages; 10261097.
1 - 30 of 12492 displayed.
  1    2    3    4    5    6    7    8    9    10    11   Next >
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy
ProQuest