Complexity of Deep Inference via Atomic Flows

DOI10.1007/978-3-642-30870-3_15MaRDI QIDQ2904403zbMATH OpenOpenAlexFDO

Authors Anupam Das

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30870-3_15

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Recommendations

• On the relative proof complexity of deep inference via atomic flows
• A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae
• Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
• On the proof complexity of deep inference
• Normalisation Control in Deep Inference via Atomic Flows
• On the proof complexity of cut-free bounded deep inference
• ReLU neural networks of polynomial size for exact maximum flow computation
• Deep Boltzmann machines: rigorous results at arbitrary depth
• On the complexity of computing and learning with multiplicative neural networks
• Polynomial‐time universality and limitations of deep learning

Cited in

(8)

• On the proof complexity of deep inference
• On the Power of Substitution in the Calculus of Structures
• On linear rewriting systems for Boolean logic and some applications to proof theory
• On the proof complexity of cut-free bounded deep inference
• A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae
• Normalisation Control in Deep Inference via Atomic Flows
• On the relative proof complexity of deep inference via atomic flows
• Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae

This page was built for publication: Complexity of Deep Inference via Atomic Flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904403)