Skip to main navigation
Skip to search
Skip to main content
University of Hertfordshire (Research Profiles) Home
Home
Profiles
Research output
Projects
Research units
Search by expertise, name or affiliation
Approximation of Boolean Functions by Local Search
A. Albrecht, C.K. Wong
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximation of Boolean Functions by Local Search'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Boolean Functions
100%
Local Search Algorithm
100%
Negative Examples
100%
Local Search
100%
Disjunctive Normal Form
100%
Simulated Annealing
50%
Hypothesis H
50%
Average-case Complexity
50%
Complexity Bounds
50%
Time Complexity
50%
Training Set
50%
Positive Instances
50%
Number of Tests
50%
High Probability
50%
Uniformly Distributed
50%
Target Function
50%
Learning Phase
50%
Generating Function
50%
Computer Science
Disjunctive Normal Form
100%
Negative Example
100%
Boolean Function
100%
Approximation (Algorithm)
100%
Target Function
50%
Learning Phase
50%
Local Search Method
50%
Local Search Algorithm
50%
Simulated Annealing
50%
Time Complexity
50%
Case Complexity
50%
Positive Example
50%
Mathematics
Local Search
100%
Boolean Function
100%
Search Algorithm
33%
Probability Theory
33%
Training Set
33%
Average-Case Complexity
33%