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
Evaluation
94%
Strategy
91%
Polynomial time
77%
Piecewise Polynomials
70%
Rational function
57%
Approximation
49%
Language
47%
Haskell
45%
Transactions
40%
Evaluation Function
39%
Complexity Theory
37%
Paradox
37%
Computability
36%
Exponential time
34%
Term
34%
Reducibility
34%
Polynomial Approximation
34%
Polynomial function
32%
Resolve
32%
Well-defined
31%
Computer Science
30%
Univariate
28%
Evidence
26%
Evaluate
25%
First-order
21%
Necessary
21%
Class
19%
Framework
18%
Standards
17%
Polynomial
17%
Operator
15%
Engineering & Materials Science
Polynomials
100%
Rational functions
57%
Computation theory
36%
Polynomial approximation
28%
Function evaluation
24%
Computer science
21%