Searching for "On Proofs in System P." – sorted by Relevance.
153 documents found, showing 1 through 10.
Next 10 →
-
Disjoint NP-pairs from propositional proof systems
- …@(email omitted); Abstract. For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which…
- Cited by 4 (2 self) – Add To MetaCart
-
Propositional Consistency Proofs
- … new proof of Reckhow's theorem that any two Frege proof systems p-simulate each other. The proofs…
- Cited by 5 (0 self) – Add To MetaCart
-
Propositional Consistency Proofs
- …'s theorem that any two Frege proof systems p-simulate each other. The proofs depend on polynomial size…
- Add To MetaCart
-
Pseudorandom Generators Hard for k-DNF Resolution and Polynomial Calculus Resolution
- … propositional proof system P if (roughly speaking) P can not ef- ciently prove the statement G n (x 1…
- Cited by 29 (3 self) – Add To MetaCart
-
Some Remarks on Lengths of Propositional Proofs
- … that renaming Frege proof systems are p-equivalent to extended Frege systems. Some open problems…
- Cited by 7 (1 self) – Add To MetaCart
-
Pseudorandom Generators in Propositional Proof Complexity
- … generator Gn : f0; 1g n ! f0; 1g m hard for a propositional proof system P if P can not eciently prove…
- Cited by 30 (4 self) – Add To MetaCart
-
Propositional Consistency Proofs
- …'s theorem that any two Frege proof systems p-simulate each other. The proofs depend on polynomial size…
- Add To MetaCart
-
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
- … sound and complete propositional proof system S and polynomial p such that all tautologies F (i.e. all…
- Add To MetaCart
-
Academy of Sciences, Prague
- … combinatorially satisfied in M . Structure M covers a propositional proof system P iff M combinatorially satisfies…
- Add To MetaCart
-
Advanced Cryptography March 12, 2003
- … Proof Systems Revisited Recall that we say that (P; V) is a (perfect) NIZK proof system for language L…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
