3

Bounded Arithmetic and Constant Depth Frege Proofs
–
 2004

32

Interpretability logic
–
 1990

45

Predicative Recursion and Computational Complexity
–
 1992

11

Bounded Arithmetic and Propositional Proof Complexity
–
 1995


Issues in Diagnosis, Supervision and Safety
–
 1996


A LinearProgramming Approach to Temporal Reasoning
–
 1996


Discrete versus Analog Computation: Aspects of Studying the Same Problem in Different Computational Models
–
 1998

1

A Geometric Theory of Outliers and Perturbation
–
 2002


The Work of Daniel A. Spielman
–
 2010


Lecturer: Alex Popa Lecture 14
–
 2008


Chapter 10 Polynomiality of Linear Programming
–


GENIE INDUSTRIEL
–

1

A New Polynomial Algorithm for Linear Programming Problem
–
 1993

5

A Polynomial Time Algorithm for The Traveling Salesman Problem
–


1 A Polynomial Time Algorithm for The Traveling Salesman Problem
–
 2008


1.4 The Shadow Vertex Pivot Rule......................... 7
–
 2008


Smoothed Analysis of InteriorPoint Algorithms: Condition Number
–
 2003

1

Computational Complexity of Temporal Constraint Problems
–
 1998

16

A Linear Programming Heuristic for Optimal Planning
–
 1997
