<--- Back to Details
First PageDocument Content
Computational complexity theory / Mathematics / Operations research / Algebra / Linear algebra / Linear complementarity problem / Mathematical optimization / Linear programming / NP / Inequality / Time complexity / LCP array
Date: 2013-01-25 04:57:12
Computational complexity theory
Mathematics
Operations research
Algebra
Linear algebra
Linear complementarity problem
Mathematical optimization
Linear programming
NP
Inequality
Time complexity
LCP array

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems Hanna SUMITA, Naonori KAKIMURA, and

Add to Reading List

Source URL: www.keisu.t.u-tokyo.ac.jp

Download Document from Source Website

File Size: 151,67 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