Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Polynomial delay

In the analysis of algorithms, an algorithm for listing a large or infinite collection of structures is said to have polynomial delay if the time… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper we propose polynomial delay algorithms for several maximal subgraph listing problems, by means of a seemingly novel… Expand
  • figure 1
  • figure 2
Is this relevant?
2010
2010
The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the… Expand
  • table 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • table I
Is this relevant?
2007
2007
This work was supported in part by the Danish Research Agency, Ministry of Science, Technology and Innovation (project no: 274… Expand
  • table 1
Is this relevant?
2007
2007
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with… Expand
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Extensions in prerequisite‐free, disjunction‐free default theories have been shown to be in direct correspondence with kernels of… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract Outliers, or commonly referred to as exceptional cases, exist in many real-world databases. Detection of such outliers… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about… Expand
  • table 2
  • table 3
Is this relevant?
1993
1993
The main result of this paper is a method that turns any almost sure sentence in the first order language of graphs into a… Expand
Is this relevant?