Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We address the following dynamic version of the school choice question: a city, named City, admits students in two temporally… 
2018
2018
In the context of black box optimization, one of the most common ways to handle deceptive attractors is to periodically restart… 
2017
2017
Aus transkultureller wie auch aus poststrukturalistischer Perspektive erscheint die Beschaftigung mit Formen von Hybriditat in… 
2017
2017
Peter Villella liefert mit der Monographie Indigenous Elites and Creole Identity in Colonial Mexico, 1500–1800 eine… 
2015
2015
In keyword search over a data graph, an answer is a non-redundant subtree that contains all the keywords of the query. A naive… 
2014
2014
In this paper, we consider the problem of mining the complete set of spatio-temporal patterns, called maximal-duration flock… 
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… 
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…