Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

JSYML
2007

favoriteEmaildiscussreport

41views more JSYML 2007»

NP search problems in low fragments of bounded arithmetic

13 years 10 months ago

NP search problems in low fragments of bounded arithmetic

Download www.newton.ac.uk

Jan Krajícek, Alan Skelley, Neil Thapen

Real-time Traffic

JSYML 2007 |

claim paper

Related Content

» The provably total NP search problems of weak second order bounded arithmetic

» On the Complexity of Nash Equilibria and Other Fixed Points

» On the Complexity of Nash Equilibria and Other Fixed Points Extended Abstract

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JSYML
Authors	Jan Krajícek, Alan Skelley, Neil Thapen

Comments (0)