Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem
Fuente:
arXiv
Guardado en:
| Autor principal: | Neukart, Florian |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Thermodynamic-Complexity Duality: Embedding Computational Hardness as a Thermodynamic Coordinate
por: Neukart, Florian, et al.
Publicado: (2025)
por: Neukart, Florian, et al.
Publicado: (2025)
Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
por: Dudeja, Rishabh, et al.
Publicado: (2022)
por: Dudeja, Rishabh, et al.
Publicado: (2022)
Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
por: Abraham, Hadas, et al.
Publicado: (2026)
por: Abraham, Hadas, et al.
Publicado: (2026)
Long Polar vs. LDPC Codes under Complexity-Constrained Decoding
por: Krieg, Felix, et al.
Publicado: (2025)
por: Krieg, Felix, et al.
Publicado: (2025)
A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
por: Ming, Gao
Publicado: (2022)
por: Ming, Gao
Publicado: (2022)
Computation of a Unified Graph-Based Rate Optimization Problem
por: Yuan, Deheng, et al.
Publicado: (2023)
por: Yuan, Deheng, et al.
Publicado: (2023)
ZENN: A Thermodynamics-Inspired Computational Framework for Heterogeneous Data-Driven Modeling
por: Wang, Shun, et al.
Publicado: (2025)
por: Wang, Shun, et al.
Publicado: (2025)
Entropy-Rank Ratio: A Novel Entropy-Based Perspective for DNA Complexity and Classification
por: Pastore, Emmanuel Pio, et al.
Publicado: (2025)
por: Pastore, Emmanuel Pio, et al.
Publicado: (2025)
Intrinsic Information Flow in Structureless NP Search
por: Wei, Jing-Yuan
Publicado: (2026)
por: Wei, Jing-Yuan
Publicado: (2026)
Information Accessibility Limits in Structured NP Search
por: Wei, Jing-Yuan
Publicado: (2026)
por: Wei, Jing-Yuan
Publicado: (2026)
Order Optimal Cascaded Code Distributed Computing With Low Complexity and Improved Flexibility
por: Zhang, Mingming, et al.
Publicado: (2023)
por: Zhang, Mingming, et al.
Publicado: (2023)
A Method to Reduce the Complexity of Computing the Complete Weight Distribution of Polar Codes
por: Liu, Zhichao, et al.
Publicado: (2024)
por: Liu, Zhichao, et al.
Publicado: (2024)
Low-Complexity OTFS-Based Over-the-Air Computation Design for Time-Varying Channels
por: Huang, Xinyu, et al.
Publicado: (2024)
por: Huang, Xinyu, et al.
Publicado: (2024)
Complexity as Advantage: A Regret-Based Perspective on Emergent Structure
por: Naparstek, Oshri
Publicado: (2025)
por: Naparstek, Oshri
Publicado: (2025)
Exploring Spatial Flexibility and Phase Design in Fluid Reconfigurable Intelligent Surfaces: A Physical Layer Security Perspective
por: Vega-Sánchez, J. D., et al.
Publicado: (2025)
por: Vega-Sánchez, J. D., et al.
Publicado: (2025)
Error-Correcting Codes for Two Bursts of t1-Deletion-t2-Insertion with Low Computational Complexity
por: Liu, Yajuan, et al.
Publicado: (2026)
por: Liu, Yajuan, et al.
Publicado: (2026)
Physical Layer Security for Sensing-Communication-Computing-Control Closed Loop: A Systematic Security Perspective
por: Lei, Chengleyang, et al.
Publicado: (2026)
por: Lei, Chengleyang, et al.
Publicado: (2026)
Some Computational Results on Koszul-Vinberg Cochain Complexes
por: Liu, Hanwen, et al.
Publicado: (2024)
por: Liu, Hanwen, et al.
Publicado: (2024)
Linear Complexity Computation of Code Distance and Minimum Size of Trapping Sets for LDPC Codes with Bounded Treewidth
por: Peng, Qingqing, et al.
Publicado: (2025)
por: Peng, Qingqing, et al.
Publicado: (2025)
Practical Channel Estimation for Pinching-Antenna Systems: Serial vs. Parallel and Downlink vs. Uplink?
por: Xiao, Jian
Publicado: (2025)
por: Xiao, Jian
Publicado: (2025)
Trace Estimation of Quantum State Powers: Sample Complexity and Computational Hardness
por: Chen, Kean, et al.
Publicado: (2025)
por: Chen, Kean, et al.
Publicado: (2025)
Thermodynamic limit under Partial Observability
por: Sudo, Akihito
Publicado: (2021)
por: Sudo, Akihito
Publicado: (2021)
DeepNP: Deep Learning-Based Noise Prediction for Ultra-Reliable Low-Latency Communications
por: Waxman, Adina, et al.
Publicado: (2021)
por: Waxman, Adina, et al.
Publicado: (2021)
PAC Codes: Sequential Decoding vs List Decoding
por: Rowshan, Mohammad, et al.
Publicado: (2020)
por: Rowshan, Mohammad, et al.
Publicado: (2020)
Exploring Hybrid Active-Passive RIS-Aided MEC Systems: From the Mode-Switching Perspective
por: Xie, Hao, et al.
Publicado: (2022)
por: Xie, Hao, et al.
Publicado: (2022)
Towards Sustainable Horizons: A Comprehensive Blueprint for Mars Colonization
por: Neukart, Florian
Publicado: (2023)
por: Neukart, Florian
Publicado: (2023)
Toward the Stars: Technological, Ethical, and Sociopolitical Dimensions of Interstellar Exploration
por: Neukart, Florian
Publicado: (2024)
por: Neukart, Florian
Publicado: (2024)
Non-Gravitational Acceleration in 3I ATLAS: Constraints on Exotic Volatile Outgassing in Interstellar Comets
por: Neukart, Florian
Publicado: (2025)
por: Neukart, Florian
Publicado: (2025)
Geometry-Information Duality: Quantum Entanglement Contributions to Gravitational Dynamics
por: Neukart, Florian
Publicado: (2024)
por: Neukart, Florian
Publicado: (2024)
Integrated Deflector Shield Technology for Spacecraft
por: Neukart, Florian
Publicado: (2024)
por: Neukart, Florian
Publicado: (2024)
Computation-Limited Signals: A Channel Capacity Regime Constrained by Computational Complexity
por: Queiroz, Saulo, et al.
Publicado: (2023)
por: Queiroz, Saulo, et al.
Publicado: (2023)
A Thermodynamic Structure of Asymptotic Inference
por: Wong, Willy
Publicado: (2026)
por: Wong, Willy
Publicado: (2026)
Representations of the Multicast Network Problem
por: Anderson, Sarah E., et al.
Publicado: (2017)
por: Anderson, Sarah E., et al.
Publicado: (2017)
On Decentralized Linearly Separable Computation With the Minimum Computation Cost
por: Chen, Haoning, et al.
Publicado: (2024)
por: Chen, Haoning, et al.
Publicado: (2024)
Social Teaching: Being Informative vs. Being Right in Sequential Decision Making
por: Rhim, Joong Bum, et al.
Publicado: (2012)
por: Rhim, Joong Bum, et al.
Publicado: (2012)
A Fractal-based Complex Belief Entropy for Uncertainty Measure in Complex Evidence Theory
por: Wu, Keming, et al.
Publicado: (2023)
por: Wu, Keming, et al.
Publicado: (2023)
The Preservation Tradeoff: A Thermodynamic Bound in the Diminishing-Returns Regime
por: Brandes, Amadeus
Publicado: (2025)
por: Brandes, Amadeus
Publicado: (2025)
Minimax Analysis of Estimation Problems in Coherent Imaging
por: Xing, Hao, et al.
Publicado: (2025)
por: Xing, Hao, et al.
Publicado: (2025)
The Sample Complexity of Lossless Data Compression
por: Viaud, Terence, et al.
Publicado: (2026)
por: Viaud, Terence, et al.
Publicado: (2026)
Locality vs Quantum Codes
por: Dai, Samuel, et al.
Publicado: (2024)
por: Dai, Samuel, et al.
Publicado: (2024)
Ejemplares similares
-
Thermodynamic-Complexity Duality: Embedding Computational Hardness as a Thermodynamic Coordinate
por: Neukart, Florian, et al.
Publicado: (2025) -
Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity
por: Dudeja, Rishabh, et al.
Publicado: (2022) -
Analyzing Collection Strategies: A Computational Perspective on the Coupon Collector Problem
por: Abraham, Hadas, et al.
Publicado: (2026) -
Long Polar vs. LDPC Codes under Complexity-Constrained Decoding
por: Krieg, Felix, et al.
Publicado: (2025) -
A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)
por: Ming, Gao
Publicado: (2022)