scientific article

zbMath0414.68023MaRDI QIDQ3049813

Forbes D. Lewis, Yuri Breitbart

Publication date: 1979

Full work available at URL: https://eudml.org/doc/92092

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitycomplexity classes of finite functionsrepresentations of Boolean functions by tables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• The network complexity and the Turing machine complexity of finite functions
• The enumerability and invariance of complexity classes
• On the Computational Complexity of Algorithms
• Classes of Recursive Functions and Their Index Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item