Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Jan Krajícek, Alan Skelley, Neil Thapen. NP search problems in low fragments of bounded arithmetic. Journal of Symbolic Logic, 72(2):649-672, 2007. [doi]
Abstract is missing.