On some "non-uniform" complexity measures
- 25 January 2006
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Initial index: A new complexity function for languagesPublished by Springer Nature ,2006
- The equivalence of Horn and network complexity for Boolean functionsActa Informatica, 1981
- Concise description of finite languagesTheoretical Computer Science, 1981
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- Remarks on the complexity of nondeterministic counter languagesTheoretical Computer Science, 1976
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969