Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Liara Aparecida dos Santos Leal"'
Autor:
Liara Aparecida dos Santos Leal, Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540290025
EUROCAST
EUROCAST
In this paper we continue along the same line of research started in earlier works, towards to providing a categorical view of structural complexity to optimization problems. The main aim is to provide a universal language for supporting formalisms t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::803cf82a84501764c73633a10bc66742
https://doi.org/10.1007/11556985_2
https://doi.org/10.1007/11556985_2
Autor:
Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes, Liara Aparecida dos Santos Leal
Publikováno v:
Computer Aided Systems Theory-EUROCAST 2003 ISBN: 9783540202219
EUROCAST
EUROCAST
Aiming at developing a theoretical framework for the formal study of NP-hard optimization problems, which is built on precise mathematical foundations, we have focused on structural properties of optimization problems related to approximative issue.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3341ac3f2bf92487076fcf0e94a677a
https://doi.org/10.1007/978-3-540-45210-2_7
https://doi.org/10.1007/978-3-540-45210-2_7
Autor:
Liara Aparecida dos Santos Leal, Dalcidio Moraes Claudio, Laira Vieira Toscani, Paulo Blauth Menezes
Publikováno v:
Computer Aided Systems Theory — EUROCAST 2001 ISBN: 9783540429593
EUROCAST
EUROCAST
This work presents a categorical approach to cope with some questions originally studied within Computational Complexity Theory. It proceeds a research with theoretical emphasis, aiming at characterising the structural properties of optimization prob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27dbc5eec451192f68105474cfd68c22
https://doi.org/10.1007/3-540-45654-6_23
https://doi.org/10.1007/3-540-45654-6_23
Publikováno v:
PAMM. 4:590-591
In the present work we are interested in to provide a universal language for supporting formalisms to specify the approximation hierarchy system for an abstract NP-hard optimization problem. This work grew from the idea of providing a categorical vie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::510f38dfd62a68a3adc969efd3e1cb25
https://doi.org/10.1002/pamm.200410276
https://doi.org/10.1002/pamm.200410276
Publikováno v:
Linear Algebra and its Applications. 99:41-61
We introduce factor circulant matrices: matrices with the structure of circulants, but with the entries below the diagonal multiplied by the same factor. The diagonalization of a circulant matrix and spectral decomposition are conveniently generalize
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b258ab6ea1350434dbd30fc2895c9023
https://doi.org/10.1016/0024-3795(88)90124-3
https://doi.org/10.1016/0024-3795(88)90124-3