Tight combinatorial generalization bounds for threshold conjunction rules
Current Language EN
English English Türkçe Türkçe Español Español Português Português Pусский Pусский Filipino Filipino Tiếng Việt Tiếng Việt हिन्दी हिन्दी العربية العربية বাংলা বাংলা Deutsch Deutsch 中文 中文

Tight combinatorial generalization bounds for threshold conjunction rules

Vorontsov, K.
lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics) 2011 Vol. 6744 LNCS pp. 66-73
225
vorontsov2011tightlecture

Access

DOI:
10.1007/978-3-642-21786-9_13

Citation

ID: 32660
Ref Key: vorontsov2011tightlecture
Use this key to autocite in SciMatic or Thesis Manager

References

References

No Bibliography

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
32660
Unique Identifier:
10.1007/978-3-642-21786-9_13
Network:
Scimatic Chain (ID: 481)
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
4/5
Blockchain Upload Locked

Complete all 5 checklist items to tokenize your article

Gas fees required in SCI Coins
Buy SCI

Saymatik Web3.0 Wallet

Google Play
App Store