Axiomatizations and Conservation Results for Fragments of Bounded Arithmetic (1990)

by Samuel R. Buss
Citations:27 - 3 self

Active Bibliography

3 Bounded Arithmetic and Constant Depth Frege Proofs – Samuel R. Buss - 2004
10 Bounded Arithmetic and Propositional Proof Complexity – Samuel R. Buss - 1995
45 Predicative Recursion and Computational Complexity – Stephen J. Bellantoni - 1992
32 Interpretability logic – Albert Visser - 1990
Issues in Diagnosis, Supervision and Safety – L. Nielsen, M. Nyberg, E. Frisk, C. Bäckström, A. Henriksson, I. Klein, F. Gustafsson, S. Gunnarsson - 1996
A Linear-Programming Approach to Temporal Reasoning – Peter Jonsson And, Peter Jonsson, Christer Backstrom - 1996
Discrete versus Analog Computation: Aspects of Studying the Same Problem in Different Computational Models – Klaus Meer - 1998
1 A Geometric Theory of Outliers and Perturbation – John D. Dunagan - 2002
The Work of Daniel A. Spielman – Gil Kalai - 2010
Lecturer: Alex Popa Lecture 14 – Scribe Tahel Ronel - 2008
Chapter 10 Polynomiality of Linear Programming – unknown authors
GENIE INDUSTRIEL – Sadia Azem, Spécialité Génie Industriel, Ordonnancement Des, Systemes Flexibles De, Production Sous, Contraintes De, Disponibilite Des, Président Eric, Pinson Professeur, Université Catholique De L'ouest, Bernard Penz, Riad Aggoune, J. Driver, Directeur Centre Sms, A. Vautrin, Professeur Centre Sms, Genie Des Procedes, G. Thomas, Professeur Centre Spin, B. Guy, Maître Centre Spin, J. Bourgois, Professeur Centre Site, E. Touboul, Ingénieur Centre Gi, O. Boissier, Professeur Centre Gi, P. Burlat, Professeur Centre Gi
1 A New Polynomial Algorithm for Linear Programming Problem – M. Manzur Murshed, B. Munir Sarwar, M. Abdus Sattar, M. Kaykobad, M. Abdus, Sattar M. Kaykobad - 1993
5 A Polynomial Time Algorithm for The Traveling Salesman Problem – Sergey Gubin
1 A Polynomial Time Algorithm for The Traveling Salesman Problem – Sergey Gubin - 2008
1.4 The Shadow Vertex Pivot Rule......................... 7 – Daniel A. Spielman, Shang-hua Teng - 2008
Smoothed Analysis of Interior-Point Algorithms: Condition Number – John Dunagan, Daniel A. Spielman, Shang-hua Teng - 2003
1 Computational Complexity of Temporal Constraint Problems – Thomas Drakengren, Peter Jonsson - 1998
16 A Linear Programming Heuristic for Optimal Planning – Tom Bylander - 1997