Search results
- 1.0534822 - ÚI 2021 NL eng J - Journal Article
Acharyya, Ankush - Nandy, S. C. - Pandit, S. - Roy, S.
Covering segments with unit squares.
Computational Geometry-Theory and Applications. Roč. 79 (2019), s. 1-13. ISSN 0925-7721. E-ISSN 1879-081X
Keywords : approximation algorithms * Segment cover * Unit square * NP-hardness * Linear programming * Approximation algorithms
Impact factor: 0.476, year: 2019
Permanent Link: http://hdl.handle.net/11104/0312984 - 2.0534821 - ÚI 2021 NL eng J - Journal Article
Acharyya, Ankush - De, M. - Nandy, S. C. - Roy, B.
Range assignment of base-stations maximizing coverage area without interference.
Theoretical Computer Science. Roč. 804 (2020), s. 81-97. ISSN 0304-3975. E-ISSN 1879-2294
Keywords : time approximation schemes * packing * Quadratic programming * Discrete packing * Range assignment in wireless communication * NP-hardness * Approximation algorithm * ptas
Impact factor: 0.827, year: 2020
Permanent Link: http://hdl.handle.net/11104/0312983 - 3.0532104 - ÚI 2021 RIV CZ eng J - Journal Article
Hartman, David - Hladík, M.
Complexity of Computing Interval Matrix Powers for Special Classes of Matrices.
Applications of Mathematics. Roč. 65, č. 5 (2020), s. 645-663. ISSN 0862-7940. E-ISSN 1572-9109.
[MAT TRIAD 2019. International Conference on Matrix Analysis and its Applications /8./. Liblice, 08.09.2019-13.09.2019]
Institutional support: RVO:67985807
Keywords : matrix power * interval matrix * interval computations * NP-hardness
OECD category: Pure mathematics
Impact factor: 0.881, year: 2020
Method of publishing: Open access with time embargo
Permanent Link: http://hdl.handle.net/11104/0310705File Download Size Commentary Version Access 0532104-afin.pdf 1 204.2 KB Publisher’s postprint open-access - 4.0531777 - ÚI 2022 RIV DE eng J - Journal Article
Hladík, M. - Hartman, David - Zamani, M.
Maximization of a PSD Quadratic Form and Factorization.
Optimization Letters. Roč. 15, č. 7 (2021), s. 2515-2528. ISSN 1862-4472. E-ISSN 1862-4480
Institutional support: RVO:67985807
Keywords : Convex quadratic form * Concave programming * NP-hardness * Upper bound * Maximum norm * Preconditioning
OECD category: Pure mathematics
Impact factor: 1.529, year: 2021
Method of publishing: Limited access
http://dx.doi.org/10.1007/s11590-020-01624-w
Permanent Link: http://hdl.handle.net/11104/0310393 - 5.0511979 - ÚI 2020 CZ eng A - Abstract
Hartman, David - Hladík, M.
Complexity of Computing Powers for Various Classes of Interval Matrices.
MAT TRIAD 2019: Book of Abstracts. Prague: MATFYZPRESS, 2019 - (Bok, J.; Hartman, D.; Hladík, M.; Rozložník, M.). s. 85-86
[MAT TRIAD 2019. International Conference on Matrix Analysis and its Applications /8./. 08.09.2019-13.09.2019, Liblice]
Institutional support: RVO:67985807
Keywords : interval matrix * matrix power * special matrix * NP-hardness
Permanent Link: http://hdl.handle.net/11104/0302210File Download Size Commentary Version Access 0511979-a.pdf 2 223.2 KB Publisher’s postprint require - 6.0507646 - ÚI 2021 RIV CH eng C - Conference Paper (international conference)
Hladík, M. - Hartman, David
Maximization of a Convex Quadratic Form on a Polytope: Factorization and the Chebyshev Norm Bounds.
Optimization of Complex Systems: Theory, Models, Algorithms and Applications. Cham: Springer, 2020 - (Le Thi, H.; Minh Le, H.; Pham Dinh, T.), s. 119-127. Advances in Intelligent Systems and Computing, 991. ISBN 978-3-030-21802-7.
[WCGO 2019: World Congress on Global Optimization /6./. Metz (FR), 08.07.2019-10.07.2019]
Institutional support: RVO:67985807
Keywords : Convex quadratic form * Relaxation * NP-hardness * Interval computation
OECD category: Pure mathematics
Permanent Link: http://hdl.handle.net/11104/0298623 - 7.0404583 - UIVT-O 20020147 RIV US eng J - Journal Article
Šíma, Jiří
Training a Single Sigmoidal Neuron is Hard.
Neural Computation. Roč. 14, č. 11 (2002), s. 2709-2729. ISSN 0899-7667. E-ISSN 1530-888X
R&D Projects: GA MŠMT LN00A056
Keywords : sigmoidal neuron * loading problem * NP-hardness
Subject RIV: BA - General Mathematics
Impact factor: 2.313, year: 2002
Permanent Link: http://hdl.handle.net/11104/0124828File Download Size Commentary Version Access 0404583.pdf 0 476.8 KB Author´s preprint open-access - 8.0404257 - UIVT-O 20010080 CZ eng V - Research Report
Šíma, Jiří
Training a Sigmoid Neuron is Hard.
Prague: ICS AS CR, 2001. 12 s. Technical Report, V-835.
R&D Projects: GA ČR GA201/00/1489; GA AV ČR IAB2030007
Institutional research plan: AV0Z1030915
Keywords : loading problem * learning complexity * NP-hardness * sigmoid neuron * back-propagation * constructive learning
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124520File Download Size Commentary Version Access v835-01.pdf 18 214 KB Other open-access - 9.0404256 - UIVT-O 20010079 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří
Minimizing the Quadratic Training Error of a Sigmoid Neuron is Hard.
Algorithmic Learning Theory. Berlin: Springer, 2001 - (Abe, N.; Khardon, R.; Zeugmann, T.), s. 92-105. Lecture Notes in Computer Science, 2225. ISBN 3-540-42875-5.
[ALT'2001. International Conference /12./. Washington (US), 25.11.2001-28.11.2001]
R&D Projects: GA AV ČR IAB2030007; GA ČR GA201/00/1489
Institutional research plan: AV0Z1030915
Keywords : loading problem * learning complexity * NP-hardness * sigmoid neuron * back-propagation * constructive learning
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124519File Download Size Commentary Version Access 0404256.pdf 0 414.5 KB Author´s preprint open-access - 10.0403980 - UIVT-O 20000120 RIV GB eng J - Journal Article
Rohn, Jiří
Computing the norm $\|A\|_{\infty,1}$ is NP-hard.
Linear & Multilinear Algebra. Roč. 47, č. 3 (2000), s. 195-204. ISSN 0308-1087. E-ISSN 1563-5139
R&D Projects: GA ČR GA201/98/0222
Grant - others:GA UK(CZ) 195/96
Institutional research plan: AV0Z1030915
Keywords : norm * positive definiteness * M-matrix * NP-hardness
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0124261