Functions that preserve p-randomness (Q393087): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q3088296
aliases / en / 0aliases / en / 0
 
Functions That Preserve p-Randomness
description / endescription / en
 
scientific article; zbMATH DE number 5940787
Property / title
 
Functions That Preserve p-Randomness (English)
Property / title: Functions That Preserve p-Randomness (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1342.68171 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-22953-4_29 / rank
 
Normal rank
Property / published in
 
Property / published in: Fundamentals of Computation Theory / rank
 
Normal rank
Property / publication date
 
19 August 2011
Timestamp+2011-08-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 August 2011 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5940787 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2019782755 / rank
 
Normal rank

Revision as of 12:52, 29 April 2024

scientific article; zbMATH DE number 5940787
  • Functions That Preserve p-Randomness
Language Label Description Also known as
English
Functions that preserve p-randomness
scientific article; zbMATH DE number 5940787
  • Functions That Preserve p-Randomness

Statements

Functions that preserve p-randomness (English)
0 references
Functions That Preserve p-Randomness (English)
0 references
0 references
0 references
0 references
16 January 2014
0 references
19 August 2011
0 references
0 references
0 references
0 references
0 references
0 references
randomness
0 references
p-randomness
0 references
complexity
0 references
polynomial-time randomness
0 references
measure
0 references
martingale
0 references
computational complexity
0 references
0 references
0 references
0 references