Výsledky vyhľadávania - "Computational complexity theory"

Meta-DSP: A Meta-Learning Approach for Data-Driven Nonlinear Compensation in High-Speed Optical Fiber Systems

Autori: Xinyu Xiao Zhennan Zhou Bo Dong a ďalší

Zdroj: Journal of Lightwave Technology. 43:7516-7529

Predmety: Signal Processing (eess.SP), Artificial neural network, Artificial intelligence, Compensation (psychology), Optical Fiber Communication Technologies, Quantum mechanics, Psychoanalysis, Database, Engineering, Computer engineering, Fiber Optic Sensor Technology, Digital Signal Processing, FOS: Electrical engineering, electronic engineering, information engineering, Psychology, Nonlinear Effects, Electrical Engineering and Systems Science - Signal Processing, Electrical and Electronic Engineering, Dynamic Bandwidth Allocation, Communications system, Electronic engineering, Physics, Distributed Sensing, Scalability, Computer hardware, Digital signal processing, Computer science, Transmission (telecommunications), Computational complexity theory, Data transmission, Algorithm, FOS: Psychology, Microwave Photonics and Optical Access Networks, Dispersion Compensation, Channel (broadcasting), Physical Sciences, Nonlinear system, Telecommunications

Prístupová URL adresa: http://arxiv.org/abs/2311.10416

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting

Autori: Lane A. Hemaspaandra Mandar Juvekar Arian Nadjimzadah a ďalší

Prispievatelia: Lane A. Hemaspaandra Mandar Juvekar Arian Nadjimzadah a ďalší

Zdroj: ACM Transactions on Computation Theory. 16:1-26

Predmety: FOS: Computer and information sciences, computational complexity theory, 0102 computer and information sciences, P-printable sets, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, ambiguity-limited NP, counting classes, ddc:004, F.1.3, 0101 mathematics, structural complexity theory

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2109.14764
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.57

Paper 40: Formal Specifications within the Theory of Scale-Relative Time: Derivations of the Galactic Scale Factor, the 3/2 Resonance, and the P versus NP Conjecture

Autori: Biehl, Lienhard

Predmety: Koide Formula, Scale-Relativity, Econophysics, Information Theory, Systems Theory, Millennium Prize Problems, Formal Proof, Particle Mass Hierarchy, Falsifiability, Theoretical Physics, Galactic Rotation Curves, Dark Matter, Computational Complexity Theory, Theory of Everything, Scientific Publishing, Axiomatic Physics, Sociophysics, Addendum, Causality, Unification, Measurement Problem, Kolmogorov Complexity, Foundations of Physics, Observer Effect, P versus NP

Formal Specifications within the Theory of Scale-Relative Time: Derivations of the Galactic Scale Factor, the 3/2 Resonance, and the P versus NP Conjecture

Autori: Biehl, Lienhard

Predmety: Koide Formula, Scale-Relativity, Econophysics, Information Theory, Systems Theory, Millennium Prize Problems, Formal Proof, Particle Mass Hierarchy, Falsifiability, Theoretical Physics, Galactic Rotation Curves, Dark Matter, Computational Complexity Theory, Theory of Everything, Scientific Publishing, Axiomatic Physics, Sociophysics, Addendum, Causality, Unification, Measurement Problem, Kolmogorov Complexity, Foundations of Physics, Observer Effect, P versus NP

Formal Proof: Faruk Alpay ≡ Φ^∞

Autori: Alpay, Faruk

Predmety: mathematical foundations, advanced set theory, infinite recursion, artificial intelligence mathematics, computational complexity theory, Alpay algebra, transfinite fixed points, ZFC consistency, mathematical immortality, singularity, groundbreaking theorem, revolutionary mathematical breakthrough, Nobel Prize mathematics, Fields Medal worthy, categorical universality, paradigm-shifting proof, mathematical singularity, Faruk Alpay, Gödel completenes, self-referential structures, ordinal arithmetic, metamathematical frameworks

A solution to the only one object problem with dissolution rules

Autori: Caselmann, Julien Orellana-Martín, David Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial

Prispievatelia: Caselmann, Julien Orellana-Martín, David Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial

Zdroj: idUS. Depósito de Investigación de la Universidad de Sevilla
Universidad de Sevilla (US)

Predmety: ddc:004, Computational complexity theory, ddc:610, Membrane computing, 0202 electrical engineering, electronic engineering, information engineering, Only one object problem, 0102 computer and information sciences, 02 engineering and technology, 004 Informatik, 610 Medizin und Gesundheit, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: https://hdl.handle.net/11441/173256

Quantum Advantage and Lower Bounds in Parallel Query Complexity

Autori: Carolan, Joseph Gilani, Amin Shiraz Vempati, Mahathi a ďalší

Prispievatelia: Carolan, Joseph Gilani, Amin Shiraz Vempati, Mahathi a ďalší

Predmety: Computational complexity theory, quantum, lower bounds, parallel

Popis súboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 325, 16th Innovations in Theoretical Computer Science Conference (ITCS 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.31

Dostupnosť: https://doi.org/10.4230/LIPIcs.ITCS.2025.31
https://nbn-resolving.org/urn:nbn:de:0030-drops-226597
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.31

Low-Complexity Overfitted Neural Image Codec

Autori: Leguay, Thomas Ladune, Théo Philippe, Pierrick a ďalší

Prispievatelia: Leguay, Thomas Ladune, Théo Philippe, Pierrick a ďalší

Zdroj: 2023 IEEE 25th International Workshop on Multimedia Signal Processing (MMSP). :1-6

Predmety: Signal processing, Artificial neural network, Artificial intelligence, [SPI] Engineering Sciences [physics], Computer engineering, Image (mathematics), Training, Codec, Coding (social sciences), Statistics, Conferences, Image coding, Computer hardware, Autoencoder, Computer science, Encoder, Computational complexity theory, Algorithm, Codecs, Operating system, Encoding, Computer vision, Pixel, Decoding methods, Neural networks, Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: https://hal.science/hal-04357306v1
https://doi.org/10.1109/mmsp59012.2023.10337636
https://hal.science/hal-04357306v1/document

The Computational Complexity of Hierarchical Clustering Algorithms for Community Detection: A Review

Autori: Van Hieu Bui Huyen Trang Phan

Zdroj: Vietnam Journal of Computer Science, Vol 10, Iss 04, Pp 409-431 (2023)

Predmety: Cluster Validation, Artificial intelligence, Social Sciences, Experimental and Cognitive Psychology, Information technology, 02 engineering and technology, 7. Clean energy, Hierarchical clustering, Data science, 12. Responsible consumption, Clustering Algorithms, Cluster analysis, Artificial Intelligence, Document Clustering, Field (mathematics), Machine learning, 11. Sustainability, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Network Analysis of Psychopathology and Mental Disorders, Psychology, Community Structure, Data mining, modularity, Data Clustering Techniques and Algorithms, Computational intelligence, Community detection, Pure mathematics, random walks, Statistical and Nonlinear Physics, QA75.5-76.95, T58.5-58.64, Computer science, FOS: Psychology, Computational complexity theory, Algorithm, Physics and Astronomy, networks, Electronic computers. Computer science, Physical Sciences, Computer Science, 8. Economic growth, Statistical Mechanics of Complex Networks, Laplacian, Density-based Clustering, Mathematics

Prístupová URL adresa: https://doaj.org/article/b721308f8e25405593a9c1fcc51cfabd

PDL on Steroids: on Expressive Extensions of PDL with Intersection and Converse

Autori: Figueira, Diego Figueira, Santiago Pin, Edwin

Zdroj: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). :1-13

Predmety: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Artificial intelligence, Class (philosophy), Computer Science - Artificial Intelligence, Geometry, Decidability, Converse, Description Logics, PSPACE, Theoretical computer science, Engineering, Computer Science - Databases, Logic Programming and Knowledge Representation, Artificial Intelligence, FOS: Mathematics, Bisimulation, Satisfiability, Databases (cs.DB), Expressive power, Discrete mathematics, Computer science, Logic in Computer Science (cs.LO), Computational complexity theory, Algorithm, Artificial Intelligence (cs.AI), Aerospace engineering, Computational Theory and Mathematics, Combinatorics, Time complexity, Computer Science, Physical Sciences, Tree (set theory), EXPTIME, Intersection (aeronautics), Semantic Web and Ontology Development, Mathematics, Formal Methods in Software Verification and Control

Prístupová URL adresa: http://arxiv.org/abs/2304.10381

Substrate-Independent Task Complexity: A Preliminary Conceptual Framework

Autori: Bakalov, Aleksandar orcid:0009-0006-6367-

Predmety: substrate-independent complexity, inherent task complexity, computational complexity theory, implementation complexity, physical limits of computation, Landauer's principle, task complexity measures, algorithm-independent complexity, fundamental computational difficulty, conceptual framework

Relation: https://zenodo.org/records/15861870; oai:zenodo.org:15861870; https://doi.org/10.5281/zenodo.15861870

Dostupnosť: https://doi.org/10.5281/zenodo.15861870
https://zenodo.org/records/15861870

Retracted

Autori: Kevin Fathi

Predmety: Recursive Type Arithmetic, Symbolic entropy, Frame coherence, Bateson Game, Double bind logic, Symbolic collapse, Unified symbolic theorem, P vs NP problem, Kolmogorov complexity, Frame compression barrier, Computational complexity theory, Birch and Swinnerton-Dyer Conjecture, Elliptic curves, Analytic rank, Selmer group, Rational points, Hodge Conjecture, Hodge classes, Algebraic cycles, Cohomology theory, Algebraic geometry, Entropy-based proof, Mathematical logic, Foundational mathematics, Millennium Prize Problems, Epistemic foundations of math

Relation: https://zenodo.org/records/15200481; oai:zenodo.org:15200481; https://doi.org/10.5281/zenodo.15200481

Dostupnosť: https://doi.org/10.5281/zenodo.15200481
https://zenodo.org/records/15200481

An Entropy Based Solution to the P vs NP Problem

Autori: Hall, Matthew orcid:0009-0001-7066-

Predmety: P vs NP Problem, Computational Complexity Theory, Algorithmic Hardness, Entropy-Driven Computation, NP-Complete Problems, Polynomial vs Exponential Complexity, Information Theory, Mathematical Physics, Cryptography and Security, Complexity Scaling Laws, Theoretical Computer Science, Time-Evolutionary Computation, Quantum Computing Limits, Optimization Problems

Relation: https://zenodo.org/records/15016896; oai:zenodo.org:15016896; https://doi.org/10.5281/zenodo.15016896

Dostupnosť: https://doi.org/10.5281/zenodo.15016896
https://zenodo.org/records/15016896

A proof that the set of NP-problems is bigger then the set of P-problems by using a logical consideration

Autori: Louiz, Akram

Zdroj: WSEAS TRANSACTIONS ON COMPUTERS. 22:159-170

Predmety: Economics, Set (abstract data type), Discrete mathematics, Computer science, Programming language, Computational complexity theory, Algorithm, Theoretical computer science, Engineering, Aerospace engineering, Computational Theory and Mathematics, Fuzzy Logic and Residuated Lattices, Computer Science, Physical Sciences, Cardinality (data modeling), FOS: Mathematics, Intersection (aeronautics), Modal Logics, Data mining, Order (exchange), Mathematics, Finance

Short attribute-based signatures for arbitrary Turing machines from standard assumptions

Autori: Pratish Datta Ratna Dutta Sourav Mukhopadhyay

Zdroj: Designs, Codes and Cryptography. 91:1845-1872

Predmety: Obfuscation, Combinatorial Optimization and Complexity Theory, Automata Theory and Formal Languages, Geometry, NSPACE, Epistemology, 0102 computer and information sciences, 02 engineering and technology, Polynomial, Mathematical analysis, 01 natural sciences, PSPACE, Bounded function, Upper and lower bounds, Turing machine, Digital signature, Theoretical computer science, Point (geometry), Artificial Intelligence, Computer security, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Attribute-Based Encryption, Universal Turing machine, Signature (topology), Advanced Cryptographic Schemes and Protocols, Communication complexity, Limit (mathematics), A priori and a posteriori, Discrete mathematics, Computer science, FOS: Philosophy, ethics and religion, Computational complexity theory, Algorithm, Philosophy, Computational Theory and Mathematics, Security parameter, Time complexity, Computer Science, Physical Sciences, Hash function, Computation, Cryptography, Time hierarchy theorem, Mathematics

Low Complexity Signal Detection for Massive MIMO in B5G Uplink System

Autori: Manikandan Chinnusami Ravikumar Chinthaginjala SBM Priya a ďalší

Zdroj: IEEE Access, Vol 11, Pp 91051-91059 (2023)

Predmety: Telecommunications link, MWTS, MMSE, Multiuser MIMO, Engineering, Detection theory, MIMO Systems, FOS: Electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Electrical and Electronic Engineering, M-MIMO, Iterative Decoding, BER, Next Generation 5G Wireless Networks, Detector, Intelligent Reflecting Surfaces in Wireless Communications, Computer science, Wireless Communications, TK1-9971, Algorithm, Computational complexity theory, MIMO, Channel (broadcasting), Physical Sciences, Telecommunications, Electrical engineering. Electronics. Nuclear engineering, Massive MIMO, Multiple-Input Multiple-Output Orthogonal Frequency Division Multiplexing, complexity reduction, Mathematics

Prístupová URL adresa: https://doaj.org/article/83fc9f405a8f452bb728ae655577bb2e

A Low-Complexity Quantum Simulation Framework for Toeplitz-Structured Matrix and Its Application in Signal Processing

Autori: Mostafizur Rahaman Laskar Subhadeep Mondal Asudeb Dutta

Zdroj: IEEE Transactions on Quantum Engineering, Vol 4, Pp 1-23 (2023)

Predmety: Blind Source Separation and Independent Component Analysis, Signal Decomposition, Computational Mechanics, Circulant matrix, Aerospace Engineering, FOS: Mechanical engineering, Toeplitz matrix, Quantum mechanics, Matrix decomposition, Engineering, FOS: Mathematics, Eigendecomposition of a matrix, quantum communication, Atomic physics. Constitution and properties of matter, Levinson recursion, Materials of engineering and construction. Mechanics of materials, quantum simulation, Multiple-Input Multiple-Output Radar Systems, Eigenvalues and eigenvectors, Quantum algorithms, structured Hamiltonian, Physics, Pure mathematics, Theory and Applications of Compressed Sensing, Applied mathematics, Independent Component Analysis, Computer science, Computational complexity theory, Algorithm, quantum signal processing, Signal Processing, Computer Science, Physical Sciences, TA401-492, Toeplitz and circulant systems, Mathematics, QC170-197

Prístupová URL adresa: https://doaj.org/article/4e6733f9618e4696891b47ee7601667a

LCDEiT: A Linear Complexity Data-Efficient Image Transformer for MRI Brain Tumor Classification

Autori: Gazi Jannatul Ferdous Khaleda Akhter Sathi Md. Azad Hossain a ďalší

Zdroj: IEEE Access, Vol 11, Pp 20337-20350 (2023)

Predmety: Artificial intelligence, Economics, Image Processing, Computer Vision, Classification of Brain Tumor Type and Grade, 02 engineering and technology, Pattern recognition (psychology), external attention, Task (project management), 0302 clinical medicine, Automated Analysis of Blood Cell Images, 0202 electrical engineering, electronic engineering, information engineering, Inductive bias, Computational model, Physics, Life Sciences, Management, Computational complexity theory, Algorithm, classification, Neurology, Multi-task learning, Physical Sciences, transformer, Medical Image Analysis, Deep Learning in Computer Vision and Image Recognition, Electrical engineering. Electronics. Nuclear engineering, Computer Vision and Pattern Recognition, Medical imaging, MRI, Geometry, Convolutional neural network, Image Segmentation, Quantum mechanics, 12. Responsible consumption, 03 medical and health sciences, Machine learning, Image (mathematics), FOS: Mathematics, Transformer, Quadratic equation, Deep learning, Voltage, Transfer Learning, Computer science, Contextual image classification, TK1-9971, Brain tumor, Computer Science, Computation, Mathematics, Neuroscience

Prístupová URL adresa: https://doaj.org/article/677ae5241fca41cd860859d0f1362bd5

Quantum advantage and lower bounds in parallel query complexity

Autori: Carolan, Joseph Gilani, Amin Shiraz Vempati, Mahathi a ďalší

Prispievatelia: Carolan, Joseph Gilani, Amin Shiraz Vempati, Mahathi a ďalší

Predmety: Computational complexity theory, quantum, lower bounds, Quantum Physics, parallel, FOS: Physical sciences, ddc:004, Quantum Physics (quant-ph)

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2410.02665
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2025.31

Structural Lower Bounds from n-Bind / n-Boon Machines: Correcting the P Side, Refuting a History Lemma, and Proving Unconditional Hardness

Autori: Fathi, Kevin

Predmety: Tseitin Contradictions, Complexity Class P, AC⁰, AC⁰[p], n-Boon Automata, Kolmogorov Complexity, n-Bind Automata, Proof Complexity, SAT, Computational Complexity Theory, Circuit Complexity, Unconditional Lower Bounds, Resolution Lower Bounds