Proof complexity of positive branching programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 176869 (Why is no real title available?)
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 2079024 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 3313255 (Why is no real title available?)
- scientific article; zbMATH DE number 7650825 (Why is no real title available?)
- A recursion-theoretic characterisation of the positive polynomial-time functions
- A sorting network in bounded arithmetic
- Branching Programs and Binary Decision Diagrams
- Expander construction in \(\mathsf{VNC}^1\)
- From positive and intuitionistic bounded arithmetic to monotone proof complexity
- Logical foundations of proof complexity
- Lower bounds on monotone complexity of the logical permanent
- Monotone proofs of the pigeon hole principle
- Monotone simulations of non-monotone proofs.
- Monotone versus positive
- Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
- Polynomial size proofs of the propositional pigeonhole principle
- Positive versions of polynomial time
- Proof Complexity
- Proof complexity of monotone branching programs
- Proofs with monotone cuts
- The complexity of theorem-proving procedures
- The method of forced enumeration for nondeterministic automata
- The relative efficiency of propositional proof systems
- Towards NP-P via proof complexity and search
This page was built for publication: Proof complexity of positive branching programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007748)
