Year of publication
Type of media
Source
Subject
Type of material
Synonyms were used for: Time
Search without synonyms: keywords:(Polynomial Time)
Used synonyms:
- tageszeit
- zeit
- zeitstruktur
-
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Online Contents | 2019|Keywords: Polynomial time solvable subclass, Polynomial time approximation scheme -
Penalty cost constrained identical parallel machine scheduling problem
Elsevier | 2015|Keywords: Polynomial time approximation scheme, Fully polynomial time approximation scheme -
On shifted Eisenstein polynomials
Online Contents | 2014|Keywords: Polynomial Time, Irreducible Polynomial, Monic Polynomial -
An improved version of Chubanov's method for solving a homogeneous feasibility problem
Free accessTaylor & Francis Verlag | 2018|Keywords: polynomial-time -
A complexity and approximation framework for the maximization scaffolding problem
Elsevier | 2015|Keywords: Polynomial-time approximation algorithm -
Fields of Algebraic Numbers Computable in Polynomial Time. II
Online Contents | 2022|Keywords: equivalence of polynomial-time computable structures, polynomial-time computable structures -
Multivariate Polynomial Decomposition
Online Contents | 2003|Keywords: Polynomial Time Algorithm, Polynomial Time, Time Algorithm, Multivariate Polynomial -
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
Online Contents | 2019|Keywords: Polynomial time solvable subclass, Polynomial time approximation scheme -
Polynomial time algorithms and extended formulations for unit commitment problems
Taylor & Francis Verlag | 2018|Keywords: polynomial-time algorithm -
On shifted Eisenstein polynomials
Online Contents | 2014|Keywords: Polynomial Time, Irreducible Polynomial, Monic Polynomial -
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
Wiley | 2016|Keywords: fully polynomial‐time approximation scheme -
Single-machine scheduling with a variable maintenance activity
Elsevier | 2014|Keywords: Polynomial-time algorithm -
Observer-based control of positive polynomial fuzzy systems with unknown time delay
Free accessBASE | 2019|Keywords: Polynomial fuzzy controller, Polynomial fuzzy observer, Positive polynomial fuzzy-model-based (PPFMB) systems, Unknown time delay -
Büchi Good-for-Games Automata Are Efficiently Recognizable
Free accessDataCite | 2018|Keywords: polynomial time -
Polynomially solvable personnel rostering problems
Elsevier | 2015|Keywords: Polynomial time algorithms -
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Elsevier | 2008|Keywords: Polynomial-time algorithm -
Robust actuator dynamics compensation method for real-time hybrid simulation
Elsevier | 2019|Keywords: Real-time hybrid simulation, Time delay, Polynomial extrapolation -
Incremental delay enumeration: Space and time
Elsevier | 2018|Keywords: Incremental time, Polynomial delay, Exponential time hypothesis -
On shifted Eisenstein polynomials
Springer Verlag | 2014|Keywords: Polynomial Time, Irreducible Polynomial, Monic Polynomial -
Theoretical and practical issues in single-machine scheduling with two job release and delivery times
Online Contents | 2021|Keywords: Time complexity, Release time, Polynomial and pseudo-polynomial time algorithms, Delivery time
Send my search to (beta)
Send your search query (search terms without filters) to other databases, portals and catalogues to find more interesting hits.
Dimensions is a database for abstracts and citations that links information on research funding with the resulting publications, studies and patents.
In the TIB AV-Portal, audiovisual media from science and teaching can be foundand own scientific videos can be published.
The FID move can be used to search for subject-specific literature, research data and other information from mobility and transport research.
The Open Research Knowledge Graph provides structured descriptions of research content and makes it comparable.
Freely accessible part of the collaborative K10plus catalogue with materials relevant for interlibrary loan and direct delivery services.