Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,206,886 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Analysis of algorithms
Clique problem
Formal concept analysis
Leslie Ann Goldberg
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Stability-Preserving, Incentive-Compatible, Time-Efficient Mechanisms for Increasing School Capacity
Tung Mai
,
V. Vazirani
arXiv.org
2019
Corpus ID: 104292243
We address the following dynamic version of the school choice question: a city, named City, admits students in two temporally…
Expand
2018
2018
Improving the run time of the (1 + 1) evolutionary algorithm with luby sequences
T. Friedrich
,
Timo Kötzing
,
Francesco Quinzan
,
Andrew M. Sutton
Annual Conference on Genetic and Evolutionary…
2018
Corpus ID: 49564079
In the context of black box optimization, one of the most common ways to handle deceptive attractors is to periodically restart…
Expand
2017
2017
Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials
G. Gutin
,
F. Reidl
,
Magnus Wahlström
,
M. Zehavi
Journal of computer and system sciences (Print)
2017
Corpus ID: 24937166
2017
2017
Bedingungen und Ertrag der Erkenntnis kultureller Hybridität in Saša Stanišićs Roman Wie der Soldat das Grammofon repariert
M. Carl
2017
Corpus ID: 151424329
Aus transkultureller wie auch aus poststrukturalistischer Perspektive erscheint die Beschaftigung mit Formen von Hybriditat in…
Expand
2017
2017
Past and Present Side By Side – A Native View on Colonial Mexico
Richard Herzog
2017
Corpus ID: 73549227
Peter Villella liefert mit der Monographie Indigenous Elites and Creole Identity in Colonial Mexico, 1500–1800 eine…
Expand
2015
2015
A Practically Efficient Algorithm for Generating Answers to Keyword Search Over Data Graphs
Konstantin Golenberg
,
Y. Sagiv
International Conference on Database Theory
2015
Corpus ID: 8081727
In keyword search over a data graph, an answer is a non-redundant subtree that contains all the keywords of the query. A naive…
Expand
2014
2014
Enumeration of complete set of flock patterns in trajectories
Xiaoliang Geng
,
Takuya Takagi
,
Hiroki Arimura
,
T. Uno
International Workshop on GeoStreaming
2014
Corpus ID: 8826799
In this paper, we consider the problem of mining the complete set of spatio-temporal patterns, called maximal-duration flock…
Expand
2005
2005
A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence
Hiroki Arimura
,
T. Uno
International Symposium on Algorithms and…
2005
Corpus ID: 10143868
In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs with…
Expand
2004
2004
Constructing Lyapunov Functions for nonlinear delay-differential equations using semidefinite programming
M. Peet
,
S. Lall
2004
Corpus ID: 15252100
1993
1993
Polynomial space polynomial delay algorithms for listing families of graphs
L. A. Goldberg
Symposium on the Theory of Computing
1993
Corpus ID: 6305108
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required