Skip to main navigation
Skip to search
Skip to main content
Aston Research Explorer Home
Help & FAQ
Home
Research units
Profiles
Research Outputs
Datasets
Student theses
Activities
Press/Media
Prizes
Equipment
Search by expertise, name or affiliation
Representations and evaluation strategies for feasibly approximable functions
Michal Konečný, Eike Neumann
Computer Science Research Group
College of Engineering and Physical Sciences
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Representations and evaluation strategies for feasibly approximable functions'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Approximation
49%
Class
19%
Complexity Theory
37%
Computability
36%
Computer Science
30%
Evaluate
25%
Evaluation
94%
Evaluation Function
39%
Evidence
26%
Exponential time
34%
First-order
21%
Framework
18%
Haskell
45%
Language
47%
Necessary
21%
Operator
15%
Paradox
37%
Piecewise Polynomials
70%
Polynomial
17%
Polynomial Approximation
34%
Polynomial function
32%
Polynomial time
77%
Rational function
57%
Reducibility
34%
Resolve
32%
Standards
17%
Strategy
91%
Term
34%
Transactions
40%
Univariate
28%
Well-defined
31%
Engineering & Materials Science
Computation theory
36%
Computer science
21%
Function evaluation
24%
Polynomial approximation
28%
Polynomials
100%
Rational functions
57%