OpenAlex
PricingAboutJobs
Log inGet started
Work

The polynomial method in circuit complexity

HTML

Year: 2002
Type: conference-paper
Source: IEEE Conference on Computational Complexity (CCC)
DOI: 10.1109/sct.1993.336538
Author: R. Beigel
Institutions: Yale University, University of Maryland, College Park
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: polynomial method, circuit complexity, constant-depth circuits, lower bounds, upper bounds, closure properties, algebraic complexity theory

Open Access status: closed
OpenAlex ID: W2147154704
FWCI: 6.612
Cites: 64
Cited by: 183
Related to: 10
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