Výsledky vyhledávání - "polynomial computational complexity"

Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states

Autoři: Dmitri A. Ivanov

Zdroj: SciPost Physics Core, Vol 7, Iss 2, p 022 (2024)
SciPost Physics Core, 7 (2)

Témata: FOS: Computer and information sciences, Quantum Physics, Computer Science - Computational Complexity, Condensed Matter - Mesoscale and Nanoscale Physics, Physics, QC1-999, Mesoscale and Nanoscale Physics (cond-mat.mes-hall), FOS: Physical sciences, 0102 computer and information sciences, Computational Complexity (cs.CC), 0101 mathematics, Quantum Physics (quant-ph), 01 natural sciences

Popis souboru: application/application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2210.11568
https://doaj.org/article/b9c9092ab9684f61a129e1ca8a4fd9a1
http://hdl.handle.net/20.500.11850/672351

Covert Communication With Polynomial Computational Complexity

Autoři: Qiaosheng Zhang Mayank Bakshi Sidharth Jaggi

Zdroj: IEEE Transactions on Information Theory. 66:1354-1384

Témata: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Přístupová URL adresa: https://research-information.bris.ac.uk/en/publications/covert-communication-with-polynomial-computational-complexity
https://ieeexplore.ieee.org/document/8913596
https://dblp.uni-trier.de/db/journals/tit/tit66.html#ZhangBJ20

Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states

Autoři: Ivanov, Dmitri A.

Témata: Quantum Physics, Condensed Matter - Mesoscale and Nanoscale Physics, Computer Science - Computational Complexity, text

URL: http://arxiv.org/abs/2210.11568

Polynomial computational complexity of matrix elements of finite-rank-generated single-particle operators in products of finite bosonic states

Autoři: Ivanov, Dmitri A.

Zdroj: SciPost Physics Core, 7 (2)

Popis souboru: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/wos/001215130400001; http://hdl.handle.net/20.500.11850/672351

Dostupnost: https://hdl.handle.net/20.500.11850/672351
https://doi.org/10.3929/ethz-b-000672351

D-stability characterization problem can exhibit a polynomial computational complexity

Autoři: Raffaella Pavani

Zdroj: AIP Conference Proceedings. 2133:050003

Témata: 0209 industrial biotechnology, Computational complexity, polynomial complexity, D-stable matrix chracterization, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://ui.adsabs.harvard.edu/abs/2019AIPC.2116e0003P/abstract
https://re.public.polimi.it/handle/11311/1127587
https://aip.scitation.org/doi/10.1063/1.5114034
https://hdl.handle.net/11311/1127587
https://doi.org/10.1063/1.5114034

Minimizing makespan of a production batch within concurrent systems: Seru production perspective

Autoři: Yin Gai Shi Qiang Liu Yong Yin a další

Zdroj: Journal of Management Science and Engineering, Vol 7, Iss 1, Pp 1-18 (2022)

Témata: 0209 industrial biotechnology, Industrial engineering. Management engineering, Assembly, Exact algorithm, 0211 other engineering and technologies, 02 engineering and technology, T55.4-60.8, 7. Clean energy, 12. Responsible consumption, Greedy algorithm, 8. Economic growth, Dimension reduction, Variability, Polynomial computational complexity

Přístupová URL adresa: https://doaj.org/article/51abc8c83daa45b4b6b18a4149495435
https://www.sciencedirect.com/science/article/pii/S2096232020300470

Covert Communication With Polynomial Computational Complexity

Autoři: Zhang, Qiaosheng Bakshi, Mayank Jaggi, Sidharth

Zdroj: Zhang, Q, Bakshi, M & Jaggi, S 2019, 'Covert Communication With Polynomial Computational Complexity', IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1354-1384.

Dostupnost: https://hdl.handle.net/1983/a9b4fe23-493b-49ce-ab64-9e33514d5e34
https://research-information.bris.ac.uk/en/publications/a9b4fe23-493b-49ce-ab64-9e33514d5e34

Covert Communication With Polynomial Computational Complexity.

Autoři: Zhang, Qiaosheng Bakshi, Mayank Jaggi, Sidharth

Zdroj: IEEE Transactions on Information Theory; Mar2020, Vol. 66 Issue 3, p1354-1384, 31p

Témata: COMPUTATIONAL complexity, POLYNOMIALS, HAMMING weight

D-stability Characterization Problem Can Exhibit A Polynomial Computational Complexity.

Autoři: Pavani, Raffaella

Zdroj: AIP Conference Proceedings; 2019, Vol. 2116 Issue 1, p050003-1-050003-4, 4p

Témata: COMPUTATIONAL complexity, POLYNOMIALS, COMPLEXITY (Philosophy)

El modelo eléctrico de conductancias aplicado al isomorfismo de grafos : el método de la estrella

Autoři: Igelmo Ganzo, Manuel

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Institut d'Organització i Control de Sistemes Industrials

Thesis Advisors: Sanfeliu, Alberto

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Àrees temàtiques de la UPC::Informàtica

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/384620
https://dx.doi.org/10.5821/dissertation-2117-96160

Algorithms for the Reconstruction of Genomic Structures with Proofs of Their Low Polynomial Complexity and High Exactness.

Autoři: Gorbunov, Konstantin Lyubetsky, Vassily

Zdroj: Mathematics (2227-7390); Mar2024, Vol. 12 Issue 6, p817, 26p

Témata: DIRECTED graphs, POLYNOMIALS, ALGORITHMS, COMPUTATIONAL complexity, MATHEMATICAL optimization, PROBLEM solving, PATHS & cycles in graph theory, BIPARTITE graphs

Medical image analysis: a systematization of knowledge on the convergence of AI and quantum computing.

Autoři: ElBedoui, Khaoula Ben Lakhal, Neila Barhoumi, Walid

Zdroj: Journal of Supercomputing. Oct2025, Vol. 81 Issue 15, p1-52. 52p.

ON POWER SUM KERNELS ON SYMMETRIC GROUPS.

Autoři: Azangulov, I. Borovitskiy, V. Smolensky, A.

Zdroj: Journal of Mathematical Sciences. Sep2025, Vol. 293 Issue 1, p12-18. 7p.

Témata: *GAUSSIAN processes, *MACHINE learning, *SYMMETRY groups, *SAMPLING (Process), *STATISTICAL models, *COMPUTATIONAL complexity, *STOCHASTIC processes

A new matrix-based-algorithm for solving latticized linear programming subject to max-min-product fuzzy relation inequalities.

Autoři: Molai, A. Abbasi

Zdroj: Iranian Journal of Fuzzy Systems; Sep/Oct2024, Vol. 21 Issue 5, p89-104, 16p

Témata: LINEAR programming, COMPOSITION operators, MATHEMATICAL optimization, LINEAR systems, COMPUTATIONAL complexity

Method of Inference of Fuzzy Logical Type Systems with Nonsingleton Fuzzification.

Autoři: Karatach, S. A. Sinuk, V. G.

Zdroj: Pattern Recognition & Image Analysis; Sep2024, Vol. 34 Issue 3, p645-651, 7p

RANDOMIZED LEAST-SQUARES WITH MINIMAL OVERSAMPLING AND INTERPOLATION IN GENERAL SPACES.

Autoři: DOLBEAULT, MATTHIEU CHKIFA, MOULAY ABDELLAH

Zdroj: SIAM Journal on Numerical Analysis; 2024, Vol. 62 Issue 4, p1515-1538, 24p

Témata: INTERPOLATION spaces, APPROXIMATION error, COMPUTATIONAL complexity, LEAST squares, INTERPOLATION

An Analysis of the Correctness and Computational Complexity of Path Planning in Payment Channel Networks

Autoři: Corcoran, Padraig Lewis, Rhyd

Témata: Computer Science - Discrete Mathematics, Computer Science - Computational Engineering, Finance, and Science, text

URL: http://arxiv.org/abs/2501.11419

Experimental Analysis of the Multidimensional-Matrix Approach to Construct Routes in a Graph.

Autoři: Morozov, S. A. Munerman, V. I. Simakov, V. A.

Zdroj: Russian Microelectronics; Dec2023, Vol. 52 Issue 7, p716-721, 6p

Témata: SPARSE matrices, DATABASES, MATRICES (Mathematics), RELATION algebras, PARALLEL programming, RELATIONAL databases

Solving minimax problems of the transport type taking into account the characteristics of the vehicles used.

Autoři: Nechitaylo, N. M.

Zdroj: AIP Conference Proceedings; 2023, Vol. 2476 Issue 1, p1-7, 7p

Témata: PROBLEM solving, TRANSPORTATION planning, LOADING & unloading, DYNAMIC programming, CHOICE of transportation

The Inference Method for a Mamdani Type System with Nonsingleton Fuzzification.

Autoři: Sinuk, V. G. Karatach, S. A.

Zdroj: Pattern Recognition & Image Analysis; Sep2023, Vol. 33 Issue 3, p506-510, 5p