Výsledky vyhledávání - Computational and structural complexity theory

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

Autoři: Lane A. Hemaspaandra Mandar Juvekar Arian Nadjimzadah a další

Přispěvatelé: Lane A. Hemaspaandra Mandar Juvekar Arian Nadjimzadah a další

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

Témata: 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 souboru: application/pdf

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

A Comparison of Structural Complexity Metrics for Explainable Genetic Programming [Poster]

Autoři: Rebuli, Karina Brotto Giacobini, Mario Silva, Sara a další

Přispěvatelé: Rebuli, Karina Brotto Giacobini, Mario Silva, Sara a další

Témata: explainable AI, interpretable models, complexity metrics, Software, Computational Theory and Mathematics, Computer Science Applications

Popis souboru: application/pdf

Relation: 979-8-4007-0120-7; PURE: 67865636

Dostupnost: http://hdl.handle.net/10362/156121

The n-Boon Automaton: A Structural Model for the Complexity Class P

Autoři: Fathi, Kevin

Témata: synergy condition, polynomial time, potential function, decidability, n-boon automaton, structural view of complexity, complexity class P, efficient computation, deterministic turing machine, computational models, structural complexity theory, success problem, P vs NP, recursive synergy

A model for the aero‐hydro‐servo‐elastic analysis of floating offshore wind turbines based on a co‐rotational formulation

Autoři: Alarcón Fernández, Daniel

Thesis Advisors: Molins i Borrell, Climent, Escola Tècnica Superior d'Enginyeria de Camins, Canals i Ports de Barcelona

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: mecánica computacional, análisis estructural dinámico no lineal, aerogeneradores marinos flotantes, modelo aero‐hidro‐servo‐elástico, método de los elementos finitos (FEM), método co‐rotacional independiente del elemento (EICR)., computational mechanics, non‐linear structural dynamic analysis, floating offshore wind turbines, aero‐hydro‐servo‐elastic model, finite elements method (FEM), Element Independent Co‐rotational method (EICR), mecànica computacional, anàlisi estructural dinàmic no lineal, aerogeneradors marins flotants, model aero‐hidro‐servo‐elàstic, mètode dels elements finits (FEM), mètode co‐rotacional independent de l'element (EICR), Àrees temàtiques de la UPC::Enginyeria civil, Àrees temàtiques de la UPC::Aeronàutica i espai, Àrees temàtiques de la UPC::Matemàtiques i estadística, 624 - Enginyeria civil i de la construcció en general, 51 - Matemàtiques, 629 - Enginyeria dels vehicles de transport

Popis souboru: application/pdf

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

Exploring the Ligand Chemical Space with Computational Tools and its Effect on the Electronic Structure of Spin-Crossover of Different Complexity

Autoři: Navarro i Maestro, Laia

Přispěvatelé: University/Department: Universitat de Barcelona. Facultat de Química

Thesis Advisors: Cirera Fernández, Jordi, Ruiz Sabín, Eliseo, Aullón López, Gabriel

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Compostos de coordinació, Compuestos de coordinación, Coordination compounds, Estructura electrònica, Estructura electrónica, Electronic structure, Metalls de transició, Metales de transición, Transition metals, Teoria del funcional de densitat, Funcionales de densidad, Density functionals, Ciències Experimentals i Matemàtiques

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10803/695508

Structural and computational aspects of simple and influence games

Autoři: Riquelme Csori, Fabián

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics

Thesis Advisors: Serna, Maria José, Molinero Albareda, Xavier

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Game theory, Hypergraph, Computational complexity, Decisive problem, Duality problem, Power indices, Solution concepts, Spread of influence, Multi-agent systems, Mediation systems, Collective choice models, Social network analysis

Popis souboru: application/pdf

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

Relativizations of the P = ? NP and Other Problems: Developments in Structural Complexity Theory

Autoři: Book, Ronald V.

Zdroj: SIAM Review, 1994 Jun 01. 36(2), 157-175.

Přístupová URL adresa: https://www.jstor.org/stable/2132459

The n-Boon Automaton: A Unified Framework for Synergy, Complexity (P, NP, PLS), and Verification

Autoři: Fathi, Kevin

Témata: synergy condition, polynomial time, potential function, decidability, n-boon automaton, structural view of complexity, complexity class P, efficient computation, deterministic turing machine, computational models, structural complexity theory, success problem, P vs NP, recursive synergy

Computational Complexity of Soundness Verification for Neural Networks

Autoři: Sirri, Scott

Témata: Berman Hartmanis Conjecture, Completeness, Artificial Intelligence and Robotics, Engineering, Theory and Algorithms, Structural Complexity Theory, Complexity theory, Machine learning, Safety-critical systems, Collapse, Reductions, Neural networks, Polynomial hierarchy

Resolving the Matrix Multiplication Exponent ω: A Dual Proof of Irreducibility and Constructive Saturation

Autoři: Fathi, Kevin orcid:0009-0001-5546-

Témata: Matrix Multiplication, Computational Complexity, Symbolic Computation, Algebraic Complexity Theory, Tensor Decomposition, Entropy Coherence, Irreducibility, Canonical Rewrite Systems, Lower Bounds, Constructive Algorithms, Border Rank, Asymptotic Complexity, Kolmogorov Complexity, Shannon Entropy', Structural Complexity Theory

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

Dostupnost: https://doi.org/10.5281/zenodo.15460322
https://zenodo.org/records/15460322

Symbolic Irreducibility of Division: An Entropy-Theoretic Separation from Addition

Autoři: Fathi, Kevin orcid:0009-0001-5546-

Témata: Symbolic entropy, Arithmetic complexity, Division irreducibility, Addition rewrite grammar, Non-confluent derivations, Entropy bifurcation, Rewrite systems, Kolmogorov complexity, Computational separability, Inverse operation hardness, Symbolic logic, Entropy curvature, Circuit depth lower bounds, Arithmetic hierarchies, Structural complexity theory, Symbolic non-reducibility, Complexity theory foundations, Canonical normal forms, Recursive grammar theory, Information-theoretic lower bounds

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

Dostupnost: https://doi.org/10.5281/zenodo.15717555
https://zenodo.org/records/15717555

On the correlation between discourse frequency and structural complexity in markedness theory

Autoři: Regina Pustet

Zdroj: Discours, Vol 5 (2009)

Témata: markedness, discourse frequency, structural complexity of linguistic items, Zipf's Law, Philology. Linguistics, P1-1091, Computational linguistics. Natural language processing, P98-98.5

Popis souboru: electronic resource

Relation: https://journals.openedition.org/discours/7683; https://doaj.org/toc/1963-1723

Přístupová URL adresa: https://doaj.org/article/facc6918b08541e1ac1802f7db7ac722

Finer-grained reductions in fine-grained hardness of approximation

Autoři: Elie Abboud Noga Ron-Zewi Elie Abboud and Noga Ron-Zewi

Přispěvatelé: Elie Abboud Noga Ron-Zewi Elie Abboud and Noga Ron-Zewi

Zdroj: Theoretical Computer Science. 1026:114976

Témata: Computational Geometry (cs.CG), FOS: Computer and information sciences, fine-grained reduction, Fine-grained complexity, Computational and structural complexity theory, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Approximation algorithms, Computational geometry, Computer Science - Computational Complexity, conditional lower bound, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Analysis of algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2311.00798
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.7

retracted

Autoři: Fathi, Kevin orcid:0009-0001-5546-

Témata: BPP, Derandomization, Pseudorandom Generators, Kolmogorov Complexity, Symbolic Compression, Indistinguishability, Kolmogorov-Random Strings, Compression-Theoretic Proof, Complexity Class Collapse, Structural Complexity Theory, Post-Quantum Resilience, One-Way Functions, Natural Proofs Barrier, Proof Complexity, Computational Learning Theory, Information-Theoretic Security, Universal Turing Machine

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

Dostupnost: https://doi.org/10.5281/zenodo.15454115
https://zenodo.org/records/15454115

On the study of delamination and failure of composite materials under static and cyclic loads

Autoři: Taherzadeh Fard, Alireza

Přispěvatelé: University/Department: Universitat Politècnica de Catalunya. Departament d'Enginyeria Civil i Ambiental

Thesis Advisors: Barbu, Lucia Gratiela, Oñate Ibáñez de Navarra, Eugenio

Zdroj: TDX (Tesis Doctorals en Xarxa)

Témata: Homogenization, Rule of mixtures, Composites, Delamination, Finite element method, Fracture mechanics, Fatigue, Kratos Multiphysics, Àrees temàtiques de la UPC::Enginyeria civil, Àrees temàtiques de la UPC::Enginyeria dels materials, 624 - Enginyeria civil i de la construcció en general, 620 - Assaig de materials. Materials comercials. Economia de l'energia

Popis souboru: application/pdf

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

Symbolic Entropy Lower Bounds for Algebraic Circuits: Escaping the Natural Proofs Barrier

Autoři: Fathi, Kevin orcid:0009-0001-5546-

Témata: Symbolic entropy, Algebraic circuit complexity, Kolmogorov irreducibility, Permanent function, VP vs. VNP, Circuit lower bounds, Non-natural proofs, Canonical rewrite systems, Entropy curvature, Structural complexity theory, Incompressibility, Complexity barriers, Natural proofs barrier, Computational irreducibility, Arithmetic complexity, Nonconstructive proof, Compression contradiction, Information-theoretic lower bounds, Algebraic hardness, Superpolynomial separation

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

Dostupnost: https://doi.org/10.5281/zenodo.15558124
https://zenodo.org/records/15558124

A survey on real structural complexity theory

Autoři: Meer, Klaus Michaux, Christian

Zdroj: Bull. Belg. Math. Soc. Simon Stevin 4, no. 1 (1997), 113-148

Témata: Research exposition (monographs, survey articles) pertaining to computer science, boolean part, Julia set, 0102 computer and information sciences, 68Q15, algorithms, 01 natural sciences, Real number models, Complexity classes (hierarchies, relations among complexity classes, etc.), 03D80, 0101 mathematics, Complexity of computation (including implicit computational complexity), Recursively (computably) enumerable sets and degrees, recursion theory, 68Q05, Models of computation (Turing machines, etc.), halting problem, structure of finite type, NP-completeness, complexity classes, real number models, algorithms over general structures, continuous domain, recursively enumerable, model theory, undecidability, 03D15, P versus NP, analogs to Turing machine

Popis souboru: application/xml; application/pdf

Přístupová URL adresa: https://zbmath.org/1260657
https://projecteuclid.org/download/pdf_1/euclid.bbms/1105730626
http://www.emis.de/journals/BMMSS/Bulletin/bul971/meer.pdf
https://projecteuclid.org/journals/bulletin-of-the-belgian-mathematical-society-simon-stevin/volume-4/issue-1/A-survey-on-real-structural-complexity-theory/10.36045/bbms/1105730626.full
http://www.kurims.kyoto-u.ac.jp/EMIS/journals/BBMS/Bulletin/bul971/meer.pdf
http://projecteuclid.org/euclid.bbms/1105730626

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

Autoři: Hemaspaandra, Lane A. Juvekar, Mandar Nadjimzadah, Arian a další

Přispěvatelé: Hemaspaandra, Lane A. Juvekar, Mandar Nadjimzadah, Arian a další

Témata: structural complexity theory, computational complexity theory, ambiguity-limited NP, counting classes, P-printable sets

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 241, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.57

Dostupnost: https://doi.org/10.4230/LIPIcs.MFCS.2022.57
https://nbn-resolving.org/urn:nbn:de:0030-drops-168552
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.57

A Minimal Constructive Proof That P ≠ NP via Witness Incompressibility

Autoři: Murphy, Andrew J

Témata: Entropy (information), Diagonalisation, Entropy, relativisation, Information Theory, Kolmogorov complexity, L vs P, Polynomial, Mathematical model, Constructive proof, Provability, Information, Polynomial time, Deterministic computation, Diagonalization, Polynomial-time algorithms, Mathematical Computing, Structural complexity theory, P vs NP, Theory of computation, NP-complete, Natural proofs barrier, uncomputability, Computational science, Non-relativizing proof, Circuit complexity, NP-completeness, Computational complexity, Proof, computational barriers, Algebrization, Information-theoretic lower bound, Algorithms, NP vs BQP, Information theory, Uniform witness generation, Logic, Cryptographic hardness, Science, Complexity class separation, algorithms, Mathematical analysis, Polynomial-time algorithm, Logic and formal systems, Turing machine, Complexity class, Theoretical computer science, polynomial computation, Decision Theory, Fuzzy Logic, FOS: Mathematics, Witness generation, Formal Verification, Cryptographic hardness assumptions, Probability, Meta-theorem separation, computability, Computability, Entropy bounds, Data Science, Pure mathematics, Models, Theoretical, Applied mathematics, Probability Theory, Incompressibility, Mathematics/methods, Provability and uncomputability, Computation, Mathematical logic, Cryptography, kolmogorov, relativization, complexity, Oracle, Mathematics, Deterministic model

Search versus Decision for Election Manipulation Problems

Autoři: Hemaspaandra, Edith Hemaspaandra, Lane A. Menton, Curtis a další

Přispěvatelé: Hemaspaandra, Edith Hemaspaandra, Lane A. Menton, Curtis a další

Zdroj: ACM Transactions on Computation Theory. 12:1-42

Témata: FOS: Computer and information sciences, I.2.11, F.1.3, F.2.2, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 16. Peace & justice, 01 natural sciences, application of structural complexity theory, Computer Science - Computational Complexity, Search vs. decision, Computer Science - Computer Science and Game Theory, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Multiagent Systems, ddc:004, Computer Science and Game Theory (cs.GT), Multiagent Systems (cs.MA)

Popis souboru: application/pdf

Přístupová URL adresa: https://dl.acm.org/doi/pdf/10.1145/3369937
http://arxiv.org/abs/1202.6641
https://dblp.uni-trier.de/db/journals/corr/corr1202.html#abs-1202-6641
https://urresearch.rochester.edu/institutionalPublicationPublicView.action?institutionalItemId=18864
http://ui.adsabs.harvard.edu/abs/2012arXiv1202.6641H/abstract
https://dl.acm.org/doi/abs/10.1145/3369937
https://dblp.uni-trier.de/db/conf/stacs/stacs2013.html#HemaspaandraHM13
https://drops.dagstuhl.de/opus/volltexte/2013/3949/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.377