OpenAlex
PricingAboutJobs
Log inGet started
Work

First Order Bounded Arithmetic and Small Boolean Circuit Complexity Classes

HTML

Year: 1995
Type: book-chapter
Source: Birkhäuser Boston eBooks
Parent work: Feasible Mathematics II
DOI: 10.1007/978-1-4612-2566-9_6
Authors: Peter Clote, Gaisi Takeuti
Institutions: Boston College, University of Illinois Urbana-Champaign
Language: English

Topic: Computability, Logic, AI Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: bounded arithmetic, first-order arithmetic, Boolean circuit complexity, threshold circuits, alternating Turing machines, primitive recursive functions

Open Access status: closed
OpenAlex ID: W169256259
FWCI: 9.407
Cites: 25
Cited by: 68
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security