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

Quantum Programming in Polylogarithmic Time

Autoři: Ferrari, Florent Hainry, Emmanuel Péchoux, Romain a další

Přispěvatelé: Ferrari, Florent Hainry, Emmanuel Péchoux, Romain a další

Témata: FOS: Computer and information sciences, Quantum programming languages, Implicit computational complexity, Polylogarithmic time, Logic in Computer Science, Programming Languages, ddc:004, Quantum circuits, Logic in Computer Science (cs.LO), Programming Languages (cs.PL)

Popis souboru: application/pdf

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

Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations

Autoři: Antonelli, Melissa Durand, Arnaud Kontinen, Juha a další

Přispěvatelé: Antonelli, Melissa Durand, Arnaud Kontinen, Juha a další

Témata: function algebras, Implicit computational complexity, ordinary differential equations, ddc:004, parallel computation, circuit complexity

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2025.10

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations

Autoři: Baillot, Patrick Dal Lago, Ugo Kop, Cynthia a další

Přispěvatelé: Baillot, Patrick Dal Lago, Ugo Kop, Cynthia a další

Zdroj: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.science/hal-05343191 ; Logical Methods in Computer Science, In press

Témata: Basic Feasible Functions Higher-Order Term Rewriting Tuple Interpretation Implicit Computational Complexity, Basic Feasible Functions, Higher-Order Term Rewriting, Tuple Interpretation, Implicit Computational Complexity, [INFO]Computer Science [cs]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2401.12385; ARXIV: 2401.12385

Dostupnost: https://hal.science/hal-05343191
https://hal.science/hal-05343191v1/document
https://hal.science/hal-05343191v1/file/A_characterization_of_BFF2025.pdf

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations (short paper)

Autoři: Antonelli, Melissa Durand, Arnaud Kontinen, Juha a další

Přispěvatelé: Antonelli, Melissa Durand, Arnaud Kontinen, Juha a další

Témata: Implicit computational complexity, Computer and information sciences, Parallel computation, Circuit complexity, Ordinary differential equations, Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10138/588839

Artifact for 'Applied Implicit Computational Complexity'

Autoři: Rusch, Neea

Témata: programming languages, static program analysis, implicit computational complexity, formal methods

Relation: https://github.com/nkrusch/dissertation; https://zenodo.org/communities/au/; https://zenodo.org/records/17148078; oai:zenodo.org:17148078; https://doi.org/10.5281/zenodo.17148078

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

A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations

Autoři: Antonelli, Melissa Durand, Arnaud Kontinen, Juha a další

Přispěvatelé: Antonelli, Melissa Durand, Arnaud Kontinen, Juha a další

Témata: Small Circuit Classes, Discrete ODEs, Implicit computational complexity, Computer and information sciences, Implicit Computational Complexity, ordinary differential equations, ddc:004, parallel computation, Parallel Computation, circuit complexity

Popis souboru: application/pdf

Přístupová URL adresa: http://hdl.handle.net/10138/585925
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.10

Branch Sequentialization in Quantum Polytime

Autoři: Hainry, Emmanuel Péchoux, Romain Silva, Mário a další

Přispěvatelé: Hainry, Emmanuel Péchoux, Romain Silva, Mário a další

Témata: FOS: Computer and information sciences, Implicit Computational Complexity, Logic in Computer Science, Quantum Circuits, ddc:004, Quantum Programs, Logic in Computer Science (cs.LO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2412.09153
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.22

A New Characterization of FAC0 via Discrete Ordinary Differential Equations

Autoři: Melissa Antonelli Arnaud Durand Juha Kontinen

Témata: Implicit computational complexity, parallel computation, ordinary differential equations, circuit complexity

Přístupová URL adresa: https://hdl.handle.net/11585/995303

Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables: Computational complexity of theories of a binary predicate with a small number of variables

Autoři: Rybakov, M.

Zdroj: Doklady Mathematics. 106:458-461

Témata: Complexity of computation (including implicit computational complexity), Church's theorem, Trakhtenbrot's theorem, undecidability, 0102 computer and information sciences, 0101 mathematics, dyadic logic, 01 natural sciences, first-order logic

Popis souboru: application/xml

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories

Autoři: Antonelli, Melissa Dal Lago, Ugo Davoli, Davide a další

Přispěvatelé: Antonelli, Melissa Dal Lago, Ugo Davoli, Davide a další

Zdroj: Leibniz International Proceedings in Informatics ; CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic ; https://hal.science/hal-04777376 ; CSL 2024 - 32nd EACSL Annual Conference on Computer Science Logic, Feb 2024, Napoli, Italy. ⟨10.4230/LIPIcs.CSL.2024.10⟩

Témata: Implicit Computational Complexity, Theory of computation → Complexity theory and logic, Theory of computation → Proof theory, Theory of computation → Proof theory Bounded Arithmetic, Randomized Computation, Bounded Arithmetic, [INFO]Computer Science [cs]

Geografické téma: Napoli, Italy

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2311.15003; info:eu-repo/grantAgreement//818616/EU/Differential Program Semantics/DIAPASoN; ARXIV: 2311.15003

Dostupnost: https://hal.science/hal-04777376
https://hal.science/hal-04777376v1/document
https://hal.science/hal-04777376v1/file/LIPIcs.CSL.2024.10.pdf
https://doi.org/10.4230/LIPIcs.CSL.2024.10

A Logarithmic Lower Bound for Oblivious RAM (for All Parameters): A logarithmic lower bound for oblivious RAM (for all parameters)

Autoři: Ilan Komargodski Wei-Kai Lin

Zdroj: Lecture Notes in Computer Science ISBN: 9783030842581

Témata: Complexity of computation (including implicit computational complexity), Data structures, Data encryption (aspects in computer science), cell-probe complexity, Cryptography, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), lower bound, 16. Peace & justice, oblivious RAM

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/chapter/10.1007/978-3-030-84259-8_20
https://dblp.uni-trier.de/db/conf/crypto/crypto2021-4.html#KomargodskiL21

Implicit recursion-theoretic characterizations of counting classes

Autoři: Ugo Dal Lago Reinhard Kahle Isabel Oitavem

Zdroj: Archive for Mathematical Logic. 61:1129-1144

Témata: #P, Counting hierarchy, Implicit computational complexity, Function algebras, Recursion-theoretic characterizations, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Computational Complexity of the Word Problem in Modal and Heyting Algebras with a Small Number of Generators: Computational complexity of the word problem in modal and Heyting algebras with a small number of generators

Autoři: Rybakov, M.

Zdroj: Russian Mathematics. 66:33-48

Témata: word problem, Complexity of computation (including implicit computational complexity), finitely generated algebra, pseudo-Boolean algebra, Heyting algebra, 0102 computer and information sciences, 01 natural sciences, Other algebras related to logic, modal algebra, Descriptive complexity and finite models, Heyting algebras (lattice-theoretic aspects), Generalizations of Boolean algebras, 0101 mathematics, Modal logic (including the logic of norms)

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7644547
https://doi.org/10.3103/s1066369x22050061

On the coprimeness relation from the viewpoint of monadic second-order logic

Autoři: Speranski, Stanislav O. Pakhomov, Fedor N.

Zdroj: Izvestiya: Mathematics. 86:1225-1239

Témata: definability, weak arithmetics, Complexity of computation (including implicit computational complexity), coprimeness, monadic second-order logic, Interpolation, preservation, definability, Second- and higher-order arithmetic and fragments

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/7733645
https://doi.org/10.4213/im9340e

Physical Computational Complexity and First-order Logic: Physical computational complexity and first-order logic

Autoři: Richard Whyman

Zdroj: Fundamenta Informaticae. 181:129-161

Témata: Complexity of computation (including implicit computational complexity), computable analysis, Blum-Shub-Smale machines, 0102 computer and information sciences, 01 natural sciences, hypercomputation, Church-Turing thesis, Turing machines and related notions, Quantum computation, Complexity classes (hierarchies, relations among complexity classes, etc.), physical computation, atemporal computation, Computation over the reals, computable analysis, non-causal computation

Popis souboru: application/xml

Přístupová URL adresa: https://dblp.uni-trier.de/db/journals/fuin/fuin181.html#Whyman21
https://content.iospress.com/articles/fundamenta-informaticae/fi2054

A tier-based typed programming language characterizing Feasible Functionals

Autoři: Hainry, Emmanuel Kapron, Bruce Marion, Jean-Yves a další

Přispěvatelé: Hainry, Emmanuel Kapron, Bruce Marion, Jean-Yves a další

Zdroj: Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)

Témata: FOS: Computer and information sciences, tiering, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], BC1-199, Computer Science - Programming Languages, Logic, computer science - programming languages, implicit computational complexity, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, type-2, Logic in Computer Science (cs.LO), computer science - logic in computer science, Feasible functionals, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], type system, Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], BFF, Programming Languages (cs.PL)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/pdf/2102.11605
https://lmcs.episciences.org/9127/pdf
http://arxiv.org/abs/2102.11605
https://lmcs.episciences.org/7216
https://doi.org/10.46298/lmcs-18(1:33)2022
https://doaj.org/article/299991e51aa94e4bb9274202323caa7a
https://inria.hal.science/hal-03722168v1/document
https://inria.hal.science/hal-03722168v1
https://doi.org/10.46298/lmcs-18(1:33)2022
https://arxiv.org/abs/2102.11605
https://hal.inria.fr/hal-02881308/document
https://doi.org/10.1145/3373718.3394768
https://dblp.uni-trier.de/db/journals/corr/corr2102.html#abs-2102-11605
https://dl.acm.org/doi/pdf/10.1145/3373718.3394768
https://hal.inria.fr/hal-02881308

Combining linear logic and size types for implicit complexity

Autoři: Baillot, Patrick Ghyselen, Alexis Patrick Baillot and Alexis Ghyselen

Přispěvatelé: Baillot, Patrick Ghyselen, Alexis Patrick Baillot and Alexis Ghyselen

Zdroj: Theoretical Computer Science. 813:70-99

Témata: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Implicit computational complexity, type systems, size types, Linear logic, Type systems, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], lambda-calculus, 01 natural sciences, Size types, linear logic, polynomial time complexity, 0202 electrical engineering, electronic engineering, information engineering, ddc:004, Polynomial time complexity

Popis souboru: application/pdf

Přístupová URL adresa: https://www.sciencedirect.com/science/article/am/pii/S0304397519305833
https://hal.archives-ouvertes.fr/hal-01687224
https://www.sciencedirect.com/science/article/pii/S0304397519305833
https://dblp.uni-trier.de/db/journals/tcs/tcs813.html#BaillotG20
https://hal.archives-ouvertes.fr/hal-01687224/document
https://doi.org/10.1016/j.tcs.2019.09.032
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2018.9
https://hal.science/hal-01948196v1
https://hal.science/hal-01687224v1/document
https://doi.org/10.1016/j.tcs.2019.09.032
https://hal.science/hal-01687224v1

Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories

Autoři: Melissa Antonelli Ugo Dal Lago Davide Davoli a další

Přispěvatelé: Melissa Antonelli Ugo Dal Lago Davide Davoli a další

Témata: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Computer and information sciences, Implicit Computational Complexity, Bounded Arithmetic, Computational Complexity, Measure-Quantified Logics, BPP, Bounded Arithmetic, Mathematics - Logic, F.4.1, F.1.3, Randomized Computation, [INFO] Computer Science [cs], Logic in Computer Science (cs.LO), Theory of computation → Proof theory, Randomized Computation, BPP, Computational Complexity, FOS: Mathematics, Theory of computation → Proof theory Bounded Arithmetic, ddc:004, Theory of computation → Complexity theory and logic, Logic (math.LO)

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2311.15003
https://hal.science/hal-04777376v1/document
https://doi.org/10.4230/lipics.csl.2024.10
https://hal.science/hal-04777376v1
http://hdl.handle.net/10138/570879
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2024.10
https://hdl.handle.net/11585/928635

On sharing, memoization, and polynomial time

Autoři: Ugo Dal Lago Martin Avanzini Dal Lago, Ugo a další

Přispěvatelé: Ugo Dal Lago Martin Avanzini Dal Lago, Ugo a další

Zdroj: Information and Computation. 261:3-22

Témata: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], polynomial time, 9. Industry and infrastructure, 1. No poverty, Implicit computational complexity, Data-tiering, Polynomial time, implicit computational complexity, 0102 computer and information sciences, data-tiering, 16. Peace & justice, 01 natural sciences, 7. Clean energy, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], 3. Good health, 12. Responsible consumption, 8. Economic growth, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Software, ddc:004, 0101 mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-01926431v1
https://doi.org/10.1016/j.ic.2018.05.003
https://cris.unibo.it/handle/11585/664479
https://dblp.uni-trier.de/db/journals/iandc/iandc261.html#AvanziniL18
https://hal.archives-ouvertes.fr/hal-01926431
https://www.sciencedirect.com/science/article/pii/S0890540118300750
https://www.sciencedirect.com/science/article/abs/pii/S0890540118300750
https://tel.archives-ouvertes.fr/INRIA/hal-01231816
https://hal.inria.fr/hal-01231816/document
https://doi.org/10.4230/LIPIcs.STACS.2015.62
https://hal.inria.fr/hal-01231816
https://dblp.uni-trier.de/db/conf/stacs/stacs2015.html#AvanziniL15
https://drops.dagstuhl.de/opus/volltexte/2015/4904/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2015.62
http://drops.dagstuhl.de/opus/institut_lipics.php?fakultaet=04
https://doi.org/10.4230/LIPIcs.STACS.2015.62
https://hdl.handle.net/11585/527013
https://hdl.handle.net/11585/664479
https://doi.org/10.1016/j.ic.2018.05.003

Polynomial time in untyped elementary linear logic

Autoři: Laurent, Olivier

Přispěvatelé: Laurent, Olivier

Zdroj: Theoretical Computer Science. 813:117-142

Témata: Elementary Linear Logic, Strong Normalization, Implicit Computational Complexity, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Polynomial Time Computation, [MATH.MATH-LO] Mathematics [math]/Logic [math.LO], 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Proof Nets

Popis souboru: application/pdf

Přístupová URL adresa: https://www.sciencedirect.com/science/article/am/pii/S0304397519306255
https://dblp.uni-trier.de/db/journals/tcs/tcs813.html#Laurent20
https://www.sciencedirect.com/science/article/pii/S0304397519306255
https://hal.archives-ouvertes.fr/hal-02333452
https://doi.org/10.1016/j.tcs.2019.10.002
https://hal.science/hal-02333452v1/document
https://hal.science/hal-02333452v1
https://doi.org/10.1016/j.tcs.2019.10.002