Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem

✍ Scribed by Neil Thapen

• Book ID: 105842449
• Publisher: Springer
• Year: 2011
• Tongue: English
• Weight: 234 KB
• Volume: 50
• Category: Article
• ISSN: 0933-5846
• DOI: 10.1007/s00153-011-0240-0