Non-perturbative graph languages, halting problem and complexity
From MaRDI portal
Recommendations
- Complexity of boundary graph languages
- Term graphs and the NP-completeness of the product-free Lambek calculus
- scientific article; zbMATH DE number 139797
- The complexity of regular DNLC graph languages
- Digraph complexity measures and applications in formal language theory
- scientific article; zbMATH DE number 3872712
- scientific article; zbMATH DE number 3885330
- scientific article; zbMATH DE number 1738663
- Context-Sensitive Languages, Rational Graphs and Determinism
- The complexity of graph languages generated by hyperedge replacement
Cites work
- A measure theoretic perspective on the space of Feynman diagrams
- A new perspective on intermediate algorithms via the Riemann-Hilbert correspondence
- Anatomy of a gauge theory
- Circuit complexity in quantum field theory
- Combinatorial Hopf algebras from renormalization
- Dyson-Schwinger equations in the theory of computation
- Formal expressions of infinite graphs and their families
- Graph grammars and their application to computer science. 4th international workshop, Bremen, Germany, March 5-9, 1990. Proceedings
- Graph grammars, insertion Lie algebras, and quantum field theory
- Graphons and renormalization of large Feynman diagrams
- Graphons, cut norm and distance, couplings and rearrangements
- scientific article; zbMATH DE number 3909745 (Why is no real title available?)
- scientific article; zbMATH DE number 4049095 (Why is no real title available?)
- scientific article; zbMATH DE number 2221919 (Why is no real title available?)
- Infinities in quantum field theory and in classical computing: renormalization program
- Introduction to Feynman integrals
- Introduction to graph grammars with applications to semantic networks
- Longitudinal and Transverse Ward–Takahashi Identities, Anomaly and Schwinger–Dyson Equation
- Non-perturbative β-functions via Feynman graphons
- On the Hopf algebra strucutre of perturbative quantum field theories
- Renormalisation and computation. II: Time cut-off and the halting problem
- Renormalization and computation. I: Motivation and background
- Renormalization of gauge fields: a Hopf algebra approach
- Sparse exchangeable graphs and their limits via graphon processes
- The analytic evolution of Dyson-Schwinger equations via homomorphism densities
- The complexities of nonperturbative computations
- The dynamics of non-perturbative phases via Banach bundles
- The Hopf algebra of Feynman graphs in quantum electrodynamics
- The master Ward identity and generalized Schwinger-Dyson equation in classical field theory
- Unique factorization in perturbative QFT
- Very large graphs
Cited in
(8)- A statistical mechanical model for non-perturbative regimes
- Graph polynomials associated with Dyson-Schwinger equations
- Halting problem in Feynman graphon processes derived from the renormalization Hopf algebra
- From Dyson-Schwinger equations to quantum entanglement
- Subsystems via quantum motions
- Quantum integrability via renormalization
- The ``zero charge problem via graphon processes
- Renormalization bi-Heyting algebra
This page was built for publication: Non-perturbative graph languages, halting problem and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2171907)
