Amanote Research

Amanote Research

    RegisterSign In

Proof Complexity Meets Algebra

ACM Transactions on Computational Logic - United States
doi 10.1145/3265985
Full Text
Open PDF
Abstract

Available in full text

Categories
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
Date

February 5, 2019

Authors
Albert AtseriasJoanna Ochremiak
Publisher

Association for Computing Machinery (ACM)


Related search

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Diagonalization in Proof Complexity

Fundamenta Mathematicae
Number TheoryAlgebra
2004English

Logic Meets Algebra: The Case of Regular Languages

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Small Heat Shock Proteins: Simplicity Meets Complexity

Journal of Biological Chemistry
BiochemistryCell BiologyMolecular Biology
2018English

Complexity in Protein Folding: Simulation Meets Experiment

Current Physical Chemistry
2012English

Witnessing Matrix Identities and Proof Complexity

International Journal of Algebra and Computation
Mathematics
2018English

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

A Cut-Free Cyclic Proof System for Kleene Algebra

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy