Almost everywhere high nonuniform complexity
- 7 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- On the notion of infinite pseudorandom sequencesTheoretical Computer Science, 1986
- How to construct random functionsJournal of the ACM, 1986
- The complexity of information extractionIEEE Transactions on Information Theory, 1986
- Relativized circuit complexityJournal of Computer and System Sciences, 1985
- Computation times of NP sets of different densitiesTheoretical Computer Science, 1984
- Circuit-size lower bounds and non-reducibility to sparse setsInformation and Control, 1982
- Families of recursive predicates of measure zeroJournal of Mathematical Sciences, 1976
- The definition of random sequencesInformation and Control, 1966
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- A formal theory of inductive inference. Part IInformation and Control, 1964