Diagonalization in Proof Complexity

Fundamenta Mathematicae - Poland
doi 10.4064/fm182-2-7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Mathematics, Polish Academy of Sciences

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

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

Investigation of the Proof Complexity Measures of Strongly Equal K-Tautologies in Some Proof Systems

Transactions on Machine Learning and Artificial Intelligence
2019English

Pebble Games, Proof Complexity, and Time-Space Trade-Offs

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Diagonalization Methods in PARSEC

Physica Status Solidi (B): Basic Research
OpticalElectronicCondensed Matter PhysicsMagnetic Materials
2006English

Stochastic Diagonalization

Springer proceedings in physics
High Energy PhysicsNuclear
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy