Pascal and Francis Bibliographic Databases

Help

Permanent link : http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21326690

Export

Selection :

Polynomial reduction of time-space scheduling to time scheduling

Author
STUDENOVSKY, J1
[1] Institute of Informatics, P.J. Šafárik University, Jesenná 5, 04154 Košice, Slovakia
Source

Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1364-1378, 15 p ; ref : 19 ref

CODEN
DAMADU
ISSN
0166-218X
Scientific domain
Control theory, operational research; Computer science; Mathematics
Publisher
Elsevier, Kidlington
Publication country
United Kingdom
Document type
Article
Language
English
Author keyword
Computational complexity Polynomial reduction Scheduling Timetabling University course timetabling problem
Keyword (fr)
Algorithme Combinatoire Complexité calcul Espace temps Informatique théorique Optimisation Ordonnancement Polynôme Temps polynomial 68M20 68Wxx Espace polynomial Radical
Keyword (en)
Algorithm Combinatorics Computational complexity Space time Computer theory Optimization Scheduling Polynomial Polynomial time Radical
Keyword (es)
Algoritmo Combinatoria Complejidad computación Espacio tiempo Informática teórica Optimización Reglamento Polinomio Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B10 Computer systems performance. Reliability

Discipline
Computer science : theoretical automation and systems Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
21326690

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web