Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Complexity hierarchies and higher-order cons-free rewriting
Cynthia Louisa Martina Kop,
Jakob Grue Simonsen
Department of Computer Science
2
Citations (Scopus)
13
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Complexity hierarchies and higher-order cons-free rewriting'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Constructor
100%
Complexity Hierarchy
100%
High-order
100%
Term Rewriting Systems
100%
Complexity Classes
100%
Reduction Strategies
66%
Nondeterminism
66%
Order-k
33%
Term Rewriting
33%
Rewriting System
33%
Product Type
33%
Implicit Computational Complexity
33%
Highly Sensitive
33%
Polynomial Time
33%
Higher-order Rewriting
33%
Computational Complexity
33%
Programming Languages
33%
Syntactic Restrictions
33%
Non-orthogonal
33%
First Order Term
33%
Computer Science
Constructors
100%
Complexity Class
100%
Term Rewriting Systems
100%
Syntactics
66%
Polynomial Time
33%
Computational Complexity
33%
Programming Language
33%
Data Structure
33%