Výsledky vyhledávání - ACM: F.: Theory of Computation/F.0: GENERAL

FAST COMPUTATION OF ALL PAIRS OF GEODESIC DISTANCES

Autoři: Noyel, Guillaume Angulo, Jesus Jeulin, Dominique a další

Přispěvatelé: Noyel, Guillaume Angulo, Jesus Jeulin, Dominique a další

Zdroj: Image Analysis and Stereology, Vol 30, Iss 2, Pp 101-109 (2011)
Image analysis and stereology

Témata: FOS: Computer and information sciences, Medicine (General), Discrete Mathematics (cs.DM), ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, fast marching, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], R5-920, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.1: Numerical Algorithms and Problems, QA1-939, FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, [MATH.TR-IMG]Mathematics [math]/domain_math.tr-img, ACM: I.: Computing Methodologies/I.5: PATTERN RECOGNITION, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, Image and Video Processing (eess.IV), Electrical Engineering and Systems Science - Image and Video Processing, geodesic propagation, all pairs of geodesic distances, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Mathematical Morphology, All pairs of geodesic distances, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.0: General/G.1.0.5: Numerical algorithms, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Mathematics, Computer Science - Discrete Mathematics

Popis souboru: application/html; application/pdf; text/plain

Přístupová URL adresa: https://www.ias-iss.org/ojs/IAS/article/download/891/789
http://arxiv.org/abs/2007.16076
https://doaj.org/article/c94b9c43b6fe431f9ee7436183e9b22b
http://ui.adsabs.harvard.edu/abs/2020arXiv200716076N/abstract
http://export.arxiv.org/pdf/2007.16076
https://arxiv.org/pdf/2007.16076.pdf
https://arxiv.org/abs/2007.16076
https://www.ias-iss.org/ojs/IAS/article/viewFile/891/789
https://hal.archives-ouvertes.fr/hal-00658907
https://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-16076
https://hal-mines-paristech.archives-ouvertes.fr/hal-00658907v2
https://hal-mines-paristech.archives-ouvertes.fr/hal-00658907/document
http://www.dlib.si/details/URN:NBN:SI:doc-PGMTUGR6

Logic, Automata, and Computational Complexity: The Works Of Stephen A. Cook. Edited by Bruce M. Kapron, ACM Books, vol. 43. Association for Computing Machinery, New York, xxvi + 398 pp.—therein: - Michelle Waitzman. Stephen Cook: Complexity’s Humble Hero, pp. 3–28. - Bruce M. Kapron and Stephen A. Cook, ACM Interview of Stephen A. Cook by Bruce M. Kapron, pp. 29–44. - Stephen A. Cook, Overview of Computational Complexity, pp. 47–70. - Christos H. Papadimitriou, Cook’s NP-Completeness Paper and the Dawn of the New Theory, pp. 73–82. - Jan Krajíček, The Cook–Reckhow Definition, pp. 83–94. - Sam Buss, Polynomially Verifiable Arithmetic, pp. 95–106. - Paul Beame and Pierre McKenzie, Towards a Complexity Theory of Parallel Computation, pp. 107–126. - Nicholas Pippenger, Computation with Limited Space, pp. 127–140. - Stephen A. Cook, The Complexity of Theorem-Proving Procedures, pp. 143–152. - Stephen A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, pp. 153–172. - Stephen A. Cook and Robert A. Reckhow, The Relative Efficiency of Propositional Proof Systems, pp. 173–192. - Stephen A. Cook, Feasibly Constructive Proofs and the Propositional Calculus (Preliminary Version), pp. 193–218. - Stephen A. Cook, Towards a Complexity Theory of Synchronous Parallel Computation, pp. 219–244. - Allan Borodin and Stephen A. Cook, A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation, pp. 245–260. - Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, and Rahul Santhanam, Pebbles and Branching Programs for Tree Evaluation, pp. 261–318. - Bruce M. Kapron, Cook’s Berkeley Notes, pp. 321–324. - Stephen A. Cook, A Survey of Classes of Primitive Recursive Functions, pp. 325–336

Autoři: Pavel Pudlák

Zdroj: The Bulletin of Symbolic Logic. 29:657-660

A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets

Autoři: Basu, Saugata Roy, Marie-Françoise Safey El Din, Mohab a další

Přispěvatelé: Basu, Saugata Roy, Marie-Françoise Safey El Din, Mohab a další

Zdroj: Foundations of Computational Mathematics. 14:1117-1172

Témata: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Computer Science - Symbolic Computation, FOS: Computer and information sciences, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], 4. Education, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, 0102 computer and information sciences, Symbolic Computation (cs.SC), 01 natural sciences, Primary 14Q20, Secondary 14P05, 68W05, Mathematics - Algebraic Geometry, FOS: Mathematics, Real algebraic variety, 0101 mathematics, Algebraic Geometry (math.AG), Baby step-giant step, Roadmaps

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/1201.6439.pdf
http://arxiv.org/abs/1201.6439
https://inria.hal.science/hal-01096209v1
https://inria.hal.science/hal-01096209v1/document
https://doi.org/10.1007/s10208-014-9212-1
https://dblp.uni-trier.de/db/journals/corr/corr1201.html#abs-1201-6439
http://core.ac.uk/display/2251749
https://hal.inria.fr/hal-01096209/document
https://hal.inria.fr/hal-01096209
https://hal-univ-rennes1.archives-ouvertes.fr/hal-01096209
https://link.springer.com/article/10.1007%2Fs10208-014-9212-1

Probabilistic Algorithm for Computing the Dimension of Real Algebraic Sets

Autoři: Bannwarth, Ivan Safey El Din, Mohab Polynomial Systems (PolSys) a další

Přispěvatelé: Bannwarth, Ivan Safey El Din, Mohab Polynomial Systems (PolSys) a další

Zdroj: ISSAC'15 - 40th International Symposium on Symbolic and Algebraic Computation ; https://hal.science/hal-01152751 ; ISSAC'15 - 40th International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. pp.37-44, ⟨10.1145/2755996.2756670⟩

Témata: Real solutions, Polynomial systems, Real Geometry General Terms Algorithms, Theory, Real dimension, ACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION/I.1.2: Algorithms, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC]

Geografické téma: Bath, United Kingdom

Dostupnost: https://hal.science/hal-01152751
https://hal.science/hal-01152751v1/document
https://hal.science/hal-01152751v1/file/HAL_issac_2015.pdf
https://doi.org/10.1145/2755996.2756670

Irreversible computable functions

Autoři: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Přispěvatelé: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Zdroj: STACS - 31st Symposium on Theoretical Aspects of Computer Science - 2014 ; https://inria.hal.science/hal-00915952 ; STACS - 31st Symposium on Theoretical Aspects of Computer Science - 2014, Mar 2014, Lyon, France

Témata: computability theory, computable analysis, finite injury, generic set, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN]

Geografické téma: Lyon, France

Dostupnost: https://inria.hal.science/hal-00915952
https://inria.hal.science/hal-00915952v4/document
https://inria.hal.science/hal-00915952v4/file/stacs.pdf

Tutorial on the event-based B method

Autoři: Cansell, Dominique Méry, Dominique Proof-oriented development of computer-based systems (MOSEL) a další

Přispěvatelé: Cansell, Dominique Méry, Dominique Proof-oriented development of computer-based systems (MOSEL) a další

Zdroj: https://cel.hal.science/inria-00092846 ; IFIP FORTE 2006 Paris, 2006.

Témata: event B formal method invariance modelling refinement theorem proving proof-base development, ACM: A.: General Literature/A.1: INTRODUCTORY AND SURVEY, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]

Dostupnost: https://cel.hal.science/inria-00092846
https://cel.hal.science/inria-00092846v1/document
https://cel.hal.science/inria-00092846v1/file/tutorialforte2006mery.pdf

Sparse bases in exact linear algebra and algorithmic simplification of biological models ; Bases creuses en algèbre linéaire exacte et simplification algorithmique de modèles biologiques

Autoři: Temperville, Alexandre Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL) Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS) a další

Přispěvatelé: Temperville, Alexandre Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL) Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS) a další

Zdroj: https://hal.science/tel-01646942 ; Bio-informatique [q-bio.QM]. Université Lille 1 - Sciences et Technologies, 2016. Français. ⟨NNT : ⟩.

Témata: symbolic computation, biological modelling, conservation law, sparse basis of a vector space, calcul formel, modélisation en biologie, loi de conservation, base creuse d'un espace vectoriel, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM], [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnost: https://hal.science/tel-01646942
https://hal.science/tel-01646942v1/document
https://hal.science/tel-01646942v1/file/these.pdf

Quantum Turing Machines: Computations and Measurements

Autoři: Stefano Guerrini Simone Martini Andrea Masini a další

Přispěvatelé: Stefano Guerrini Simone Martini Andrea Masini a další

Zdroj: Applied Sciences, Vol 10, Iss 16, p 5551 (2020)
Applied Sciences
Volume 10
Issue 16

Témata: FOS: Computer and information sciences, Technology, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], QH301-705.5, QC1-999, computability theory, computer science, 0102 computer and information sciences, 01 natural sciences, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Biology (General), 0101 mathematics, QD1-999, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Physics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], theory of programming languages, Engineering (General). Civil engineering (General), 16. Peace & justice, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, Logic in Computer Science (cs.LO), Chemistry, quantum Turing machines, 13. Climate action, TA1-2040, F.1.1

Popis souboru: application/pdf

Přístupová URL adresa: https://www.mdpi.com/2076-3417/10/16/5551/pdf
http://arxiv.org/abs/1703.07748
https://doaj.org/article/19dc75abb6944c448a01a2618877cf97
https://iris.univr.it/handle/11562/1023699
https://arxiv.org/abs/1703.07748
https://www.mdpi.com/2076-3417/10/16/5551
https://cris.unibo.it/handle/11585/768292
https://arxiv.org/pdf/1703.07748.pdf
https://www.mdpi.com/2076-3417/10/16/5551/pdf
https://arxiv.org/abs/1703.07748
http://ui.adsabs.harvard.edu/abs/2017arXiv170307748G/abstract
https://arxiv.org/pdf/1703.07748
https://www.mdpi.com/2076-3417/10/16/5551
https://doi.org/10.3390/app10165551
https://hdl.handle.net/11585/768292

The Event-B Modelling Method - Concepts and Case Studies

Autoři: Cansell, Dominique Méry, Dominique Proof-oriented development of computer-based systems (MOSEL) a další

Přispěvatelé: Cansell, Dominique Méry, Dominique Proof-oriented development of computer-based systems (MOSEL) a další

Zdroj: Logics of Specification Languages ; https://inria.hal.science/inria-00579550 ; Dines Bjoerner and Martin Henson. Logics of Specification Languages, Springer, pp.33-140, 2008, Monographs in Theoretical Computer Science

Témata: Event B, Formal Method, Refinement, Abstraction, Modelling, Case studies, Methodology, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, ACM: I.: Computing Methodologies/I.0: GENERAL, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]

Dostupnost: https://inria.hal.science/inria-00579550

Modular termination of C programs

Autoři: Andrieu, Guillaume Alias, Christophe Gonnord, Laure a další

Přispěvatelé: Andrieu, Guillaume Alias, Christophe Gonnord, Laure a další

Zdroj: https://inria.hal.science/hal-00760917 ; [Research Report] RR-8166, INRIA. 2012.

Témata: termination, static analysis, modularity, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.0: General, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems

Dostupnost: https://inria.hal.science/hal-00760917
https://inria.hal.science/hal-00760917v2/document
https://inria.hal.science/hal-00760917v2/file/RR-8166.pdf

Genericity of weakly computable objects

Autoři: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Přispěvatelé: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Zdroj: ISSN: 1432-4350.

Témata: Computable Analysis, Priority method, Generic, Irreversible function, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN]

Dostupnost: https://inria.hal.science/hal-01095864
https://inria.hal.science/hal-01095864v2/document
https://inria.hal.science/hal-01095864v2/file/revision.pdf
https://doi.org/10.1007/s00224-016-9737-6

Topological Aspects of Representations in Computable Analysis ; Aspects Topologiques des Représentations en Analyse Calculable

Autoři: Hoyrup, Mathieu Designing the Future of Computational Models (MOCQUA) Centre Inria de l'Université de Lorraine a další

Přispěvatelé: Hoyrup, Mathieu Designing the Future of Computational Models (MOCQUA) Centre Inria de l'Université de Lorraine a další

Zdroj: https://inria.hal.science/tel-03932408 ; Computer Science [cs]. Université de Lorraine, 2023.

Témata: computability, representation, topology, descriptive complexity, Calculabilité, représentation, topologie, complexité descriptive, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, [INFO]Computer Science [cs], [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Dostupnost: https://inria.hal.science/tel-03932408
https://inria.hal.science/tel-03932408v1/document
https://inria.hal.science/tel-03932408v1/file/hdr.pdf

Conception de traces, et applications, vers une méta-théorie des traces (Towards a Meta-Thoery of traces)

Autoři: Deransart, Pierre Constraint programming (CONTRAINTES) Inria Paris-Rocquencourt a další

Přispěvatelé: Deransart, Pierre Constraint programming (CONTRAINTES) Inria Paris-Rocquencourt a další

Zdroj: https://hal.inria.fr/inria-00370211 ; 2009.

Témata: trace meta-theory, observational semantics, interpretative semantics, software engineering, logic programming, process obervation, process analysis, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.1: Specifying and Verifying and Reasoning about Programs, ACM: H.: Information Systems/H.1: MODELS AND PRINCIPLES/H.1.0: General, ACM: I.: Computing Methodologies/I.1: SYMBOLIC AND ALGEBRAIC MANIPULATION, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], [SCCO.COMP]Cognitive science/Computer science, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]

Relation: inria-00370211; https://hal.inria.fr/inria-00370211; https://hal.inria.fr/inria-00370211/document; https://hal.inria.fr/inria-00370211/file/DT-MThTraces0903.pdf

Dostupnost: https://hal.inria.fr/inria-00370211
https://hal.inria.fr/inria-00370211/document
https://hal.inria.fr/inria-00370211/file/DT-MThTraces0903.pdf

Hilbert and Pólya conjecture, dynamical system, prime numbers, black Holes, quantum mechanics, and the Riemann hypothesis

Autoři: Sghiar, M. Chercheur indépendant

Přispěvatelé: Sghiar, M. Chercheur indépendant

Zdroj: ISSN: 2278-0661 ; IOSR Journal of Computer Engineering (IOSR - JCE) ; https://hal.science/hal-04054250 ; IOSR Journal of Computer Engineering (IOSR - JCE) , 2023, Volume 25 (5), pp.54-60. ⟨10.9790/0661-2505015460⟩.

Témata: Riemann hypothesis, Prime Number number theory distribution of prime numbers the law of prime numbers the Gamma function the Mertens function quantum mechanics black Holes holomorphic function the Riemann hypothesis, the Mertens function, quantum mechanics, black Holes, the Riemann hypothesis, Hilbert-Polya's conjecture, Prime Number number theory distribution of prime numbers the law of prime numbers the Gamma function, Prime Number, number theory, distribution of prime numbers, the law of prime numbers, the Gamma function, holomorphic function, MESH: number theory, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C00 - General, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C02 - Mathematical Methods, ACM: F.: Theory of Computation, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Relation: hal-04054250; https://hal.science/hal-04054250; https://hal.science/hal-04054250v5/document; https://hal.science/hal-04054250v5/file/2DPBQRH.pdf

Dostupnost: https://hal.science/hal-04054250
https://hal.science/hal-04054250v5/document
https://hal.science/hal-04054250v5/file/2DPBQRH.pdf
https://doi.org/10.9790/0661-2505015460

Hilbert and Pólya conjecture, dynamical system, prime numbers, black Holes, quantum mechanics, and the Riemann hypothesis

Autoři: Sghiar, M. J. Chercheur indépendant

Přispěvatelé: Sghiar, M. J. Chercheur indépendant

Zdroj: https://hal.science/hal-04054250 ; 2023.

Témata: Prime Number number theory distribution of prime numbers the law of prime numbers the Gamma function, Prime Number, number theory, distribution of prime numbers, the law of prime numbers, the Gamma function, holomorphic function, Riemann hypothesis, Prime Number number theory distribution of prime numbers the law of prime numbers the Gamma function the Mertens function quantum mechanics black Holes holomorphic function the Riemann hypothesis, the Mertens function, quantum mechanics, black Holes, the Riemann hypothesis, Hilbert-Polya's conjecture, MESH: number theory, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C00 - General, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C02 - Mathematical Methods, ACM: F.: Theory of Computation, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Relation: hal-04054250; https://hal.science/hal-04054250; https://hal.science/hal-04054250v4/document; https://hal.science/hal-04054250v4/file/2DPBQRH.pdf

Dostupnost: https://hal.science/hal-04054250
https://hal.science/hal-04054250v4/document
https://hal.science/hal-04054250v4/file/2DPBQRH.pdf

On the inversion of computable functions

Autoři: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Přispěvatelé: Hoyrup, Mathieu Theoretical adverse computations, and safety (CARTE) Centre Inria de l'Université de Lorraine a další

Zdroj: https://inria.hal.science/hal-00735681 ; [Research Report] 2012.

Témata: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.2: Computability theory, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [MATH.MATH-GN]Mathematics [math]/General Topology [math.GN]

Dostupnost: https://inria.hal.science/hal-00735681
https://inria.hal.science/hal-00735681v2/document
https://inria.hal.science/hal-00735681v2/file/draft.pdf

Dynamical system,prime numbers,black Holes,quantum mechanics, and the Riemann hypothesis

Autoři: Sghiar, Mohamed Chercheur indépendant

Přispěvatelé: Sghiar, Mohamed Chercheur indépendant

Zdroj: https://hal.science/hal-04054250 ; 2023.

Témata: Prime Number number theory distribution of prime numbers the law of prime numbers the Gamma function, Prime Number, number theory, distribution of prime numbers, the law of prime numbers, the Gamma function, holomorphic function, Riemann hypothesis, MESH: number theory, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C00 - General, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C02 - Mathematical Methods, ACM: F.: Theory of Computation, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Relation: hal-04054250; https://hal.science/hal-04054250; https://hal.science/hal-04054250v2/document; https://hal.science/hal-04054250v2/file/2DPBQRH.pdf

Dostupnost: https://hal.science/hal-04054250
https://hal.science/hal-04054250v2/document
https://hal.science/hal-04054250v2/file/2DPBQRH.pdf

Dynamical system, prime numbers, and black holes

Autoři: Sghiar, Mohamed Chercheur indépendant

Přispěvatelé: Sghiar, Mohamed Chercheur indépendant

Zdroj: https://hal.science/hal-04054250 ; 2023.

Témata: Prime Number number theory distribution of prime numbers the law of prime numbers the Gamma function, Prime Number, number theory, distribution of prime numbers, the law of prime numbers, the Gamma function, MESH: number theory, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C00 - General, JEL: C - Mathematical and Quantitative Methods/C.C0 - General/C.C0.C02 - Mathematical Methods, ACM: F.: Theory of Computation, [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT]

Relation: hal-04054250; https://hal.science/hal-04054250; https://hal.science/hal-04054250/document; https://hal.science/hal-04054250/file/Dynamical%20system,%20prime%20numbers,%20and%20black%20holes.pdf

Dostupnost: https://hal.science/hal-04054250
https://hal.science/hal-04054250/document
https://hal.science/hal-04054250/file/Dynamical%20system,%20prime%20numbers,%20and%20black%20holes.pdf

The dark side of financial dynamics: a Schumpeterian destructive creation process

Autoři: Klapkiv, Lyubov Ülgen, Faruk Maria Curie-Sklodowska University (UMCS) a další

Přispěvatelé: Klapkiv, Lyubov Ülgen, Faruk Maria Curie-Sklodowska University (UMCS) a další

Zdroj: Bank I Kredyt (Bank and Credit) ; https://shs.hal.science/halshs-04746678 ; Bank I Kredyt (Bank and Credit), 2024, 55 (5), pp.661-682 ; https://bankikredyt.nbp.pl/content/2024/05/BIK_05_2024_05.pdf

Témata: destructive creation, evolutionary economics, financial crises, regulation, innovation, creative destruction, Słowa kluczowe: destrukcyjna twórczość, ekonomia ewolucyjna, kryzysy finansowe, regulacja, innowacje, twórcza destrukcja, JEL: B - History of Economic Thought, Methodology, and Heterodox Approaches/B.B5 - Current Heterodox Approaches/B.B5.B52 - Institutional • Evolutionary, JEL: E - Macroeconomics and Monetary Economics/E.E1 - General Aggregative Models/E.E1.E14 - Austrian • Evolutionary • Institutional, JEL: G - Financial Economics/G.G0 - General/G.G0.G01 - Financial Crises, JEL: G - Financial Economics/G.G1 - General Financial Markets/G.G1.G18 - Government Policy and Regulation, JEL: O - Economic Development, Technological Change, and Growth/O.O3 - Innovation • Research and Development • Technological Change • Intellectual Property Rights/O.O3.O31 - Innovation and Invention: Processes and Incentives, ACM: F.: Theory of Computation, [SHS.ECO]Humanities and Social Sciences/Economics and Finance

Dostupnost: https://shs.hal.science/halshs-04746678

The dark side of financial dynamics: a Schumpeterian destructive creation process

Autoři: Lyubov Klapkiv Faruk Ulgen Ciesla, Catherine a další

Přispěvatelé: Lyubov Klapkiv Faruk Ulgen Ciesla, Catherine a další

Zdroj: Bank i Kredyt. 55:661-682

Témata: financial crises, JEL: G - Financial Economics/G.G0 - General/G.G0.G01 - Financial Crises, JEL: O - Economic Development, ekonomia ewolucyjna, Methodology, and Heterodox Approaches/B.B5 - Current Heterodox Approaches/B.B5.B52 - Institutional • Evolutionary, JEL: G - Financial Economics/G.G1 - General Financial Markets/G.G1.G18 - Government Policy and Regulation, regulation, creative destruction, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, Technological Change, ACM: F.: Theory of Computation, innovation, JEL: B - History of Economic Thought, regulacja, twórcza destrukcja, kryzysy finansowe, Słowa kluczowe: destrukcyjna twórczość, JEL: E - Macroeconomics and Monetary Economics/E.E1 - General Aggregative Models/E.E1.E14 - Austrian • Evolutionary • Institutional, evolutionary economics, and Growth/O.O3 - Innovation • Research and Development • Technological Change • Intellectual Property Rights/O.O3.O31 - Innovation and Invention: Processes and Incentives, destructive creation, [SHS.ECO] Humanities and Social Sciences/Economics and Finance, innowacje

Přístupová URL adresa: https://shs.hal.science/halshs-04746678v1