On the Relative Proof Complexity of Deep Inference via Atomic Flows

Logical Methods in Computer Science - Germany
doi 10.2168/lmcs-11(1:4)2015
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Logical Methods in Computer Science e.V.

Related search

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Proof Complexity Meets Algebra

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2019English

Diagonalization in Proof Complexity

Fundamenta Mathematicae
Number TheoryAlgebra
2004English

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Inference on Graphs via Semidefinite Programming

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2016English

Witnessing Matrix Identities and Proof Complexity

International Journal of Algebra and Computation
Mathematics
2018English

Table of Relative Atomic Weights

2017English

The Relative Complexity of NP Search Problems

1995English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy