Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions
Copyright policy )Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Rutgers, The State University of New Jersey United States
- Kyoto University Japan
- Osaka University Japan
partially defined Boolean functions, polynomial algorithms, Analysis of algorithms and problem complexity, Learning and adaptive systems in artificial intelligence, Theoretical Computer Science, Computer Science Applications, Computational Theory and Mathematics, NP-hardness, learning from examples, minimum error extension, Boolean functions, induction, Information Systems
partially defined Boolean functions, polynomial algorithms, Analysis of algorithms and problem complexity, Learning and adaptive systems in artificial intelligence, Theoretical Computer Science, Computer Science Applications, Computational Theory and Mathematics, NP-hardness, learning from examples, minimum error extension, Boolean functions, induction, Information Systems
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).47 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!