Tropical proof systems: between R(CP) and resolution

Cites work

Boolean function complexity. Advances and frontiers.
Complexity of solving tropical linear systems
Discretely ordered modules as a first-order extension of the cutting planes proof system
Hard examples for resolution
scientific article; zbMATH DE number 1256733 (Why is no real title available?)
scientific article; zbMATH DE number 6437647 (Why is no real title available?)
scientific article; zbMATH DE number 3325539 (Why is no real title available?)
Lower bounds for resolution and cutting plane proofs and monotone computations
Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
Max-linear systems. Theory and algorithms.
On the complexity of cutting-plane proofs
On the power and limitations of branch and cut
On the weak pigeonhole principle
Prime congruences of additively idempotent semirings and a Nullstellensatz for tropical polynomials
Proof Complexity
Resolution over linear equations and multilinear proofs
Resolution over linear equations modulo two
Resolution with counting: dag-like lower bounds and different moduli
Semialgebraic proofs, IPS lower bounds, and the -conjecture: can a natural number be negative?
Several notes on the power of Gomory-Chvátal cuts
Stabbing planes
The intractability of resolution
The relative efficiency of propositional proof systems
The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems
The tropical Nullstellensatz for congruences
Tropical effective primary and dual Nullstellensätze
Tropical Fourier-Motzkin elimination, with an application to real-time verification
Tropical ideals

This page was built for publication: Tropical proof systems: between R(CP) and resolution

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