Scholarlink

In this chapter, we study the circuit and advice computation models. The former models characterize parallel computation; our specific interest is in the uniform and nonuniform polynomial-size circuits. The advice computation models mathematically characterize polynomial-size circuit classes.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Circuit Complexity and Unambiguity

  • 章节

  • 发表日期：

    2025年

查看全文
  • Mitsunori Ogihara

摘要

In this chapter, we study the circuit and advice computation models. The former models characterize parallel computation; our specific interest is in the uniform and nonuniform polynomial-size circuits. The advice computation models mathematically characterize polynomial-size circuit classes.