OpenAlex
PricingAboutJobs
Log inGet started
Work

Boosting and hard-core sets

HTML

Year: 2003
Type: conference-paper
Source: Annual Symposium on Foundations of Computer Science
DOI: 10.1109/sffcs.1999.814638
Authors: A.R. Klivans, R.A. Servedio
Institutions: Massachusetts Institute of Technology, Harvard University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: boosting, hardness amplification, DNF learning, membership queries, computational learning theory, computational complexity

Open Access status: closed
OpenAlex ID: W2118991990
FWCI: 2.567
Cites: 32
Cited by: 49
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security