Does Advice Help to Prove Propositional Tautologies? (Q3637158): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1533547276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic advice classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Instance Complexity and Proof Systems with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Karp-Lipton Collapse Result in Bounded Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal proof systems imply complete sets for promise classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank

Latest revision as of 18:58, 1 July 2024