Time bounded frequency computations (Q1383147): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some connections between bounded query classes and non-uniform complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial terse sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-reducibility and weak P-selectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of frequency computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Automata, a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomially D verbose sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Membership Comparable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586282 / rank
 
Normal rank

Revision as of 11:00, 28 May 2024

scientific article
Language Label Description Also known as
English
Time bounded frequency computations
scientific article

    Statements

    Identifiers