Witnessing functions in bounded arithmetic and search problems (Q4227882): 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: W2056827464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the scheme of induction for bounded arithmetic formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded arithmetic and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / 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: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provability of the pigeonhole principle and the existence of infinitely many primes / rank
 
Normal rank

Latest revision as of 18:17, 28 May 2024

scientific article; zbMATH DE number 1247649
Language Label Description Also known as
English
Witnessing functions in bounded arithmetic and search problems
scientific article; zbMATH DE number 1247649

    Statements

    Witnessing functions in bounded arithmetic and search problems (English)
    0 references
    0 references
    0 references
    19 August 1999
    0 references
    bounded arithmetic
    0 references
    search problems
    0 references
    weak subsystems of first-order arithmetic
    0 references
    computational complexity
    0 references
    witnessing theorems
    0 references
    complexity classes
    0 references
    multifunctions
    0 references
    separation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references