<--- Back to Details
First PageDocument Content
Mathematical logic / Mathematical proofs / Proof theory / Mathematical optimization / Interval arithmetic / Computer-assisted proof / Linear programming / Logarithm / Maple / Mathematics / Operations research / Automated theorem proving
Date: 2008-12-12 05:03:04
Mathematical logic
Mathematical proofs
Proof theory
Mathematical optimization
Interval arithmetic
Computer-assisted proof
Linear programming
Logarithm
Maple
Mathematics
Operations research
Automated theorem proving

Computer-assisted proofs Arnold Neumaier Fakult¨at f¨ur Mathematik, Universit¨at Wien Nordbergstr. 15, A-1090 Wien, Austria http://www.mat.univie.ac.at/∼neum/

Add to Reading List

Source URL: www.mat.univie.ac.at

Download Document from Source Website

File Size: 76,80 KB

Share Document on Facebook

Similar Documents

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

Leveraging Linear and Mixed Integer Programming for SMT Tim King1 Clark Barrett1 1 New

DocID: 1xVFF - View Document

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

Exploiting Anonymity in Approximate Linear Programming: Scaling to Large Multiagent MDPs

DocID: 1xUZo - View Document

Mixed-Integer Linear Programming �LP�Branch-and-Bound Search

Mixed-Integer Linear Programming LPBranch-and-Bound Search

DocID: 1voVH - View Document

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by  Matthew Galati

DECOMPOSITION METHODS FOR INTEGER LINEAR PROGRAMMING by Matthew Galati

DocID: 1vkrh - View Document

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ †  David R. Cher

Approximate Linear Programming for Constrained Partially Observable Markov Decision Processes Pascal Poupart† , Aarti Malhotra† , Pei Pei† , Kee-Eung Kim§ , Bongseok Goh§ and Michael Bowling‡ † David R. Cher

DocID: 1vcNT - View Document