検索結果

…[[EXPTIME]]にも同じ記述があるが、succinct circuit 自体はデータの表現方法であり、元の問題がP完全なら（succinct circuit を使えば）EXPTIME完全となり、NP完全ならNEXPTIME完全になるということであって、矛盾しているわけではない。</ref>。 * Complexity Zoo: [http://qwiki.caltech.edu/wiki/Complexity_Zoo#nexp NEXP], [http://qwik …

'''回路計算量'''（{{Lang-en-short|circuit complexity}}）とは、[[計算複雑性理論]]において、[[ブール関数]]をその計算に要する[[計算資源]]の量によって分類することを指す。回路計算量では、それらの …link=Aleksandr Aleksandrovich Razborov |title=Lower bounds on the monotone complexity of some Boolean functions |date=1985 |journal=[[Soviet Mathematics - Doklad …

…annover.de/forschung/publikationen/cc/index.en.php Introduction to Circuit Complexity -- A Uniform Approach]''. ISBN 3-540-64310-9 …ook|author = Christos Papadimitriou | date = 1993年 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st edition | id = ISBN 0-201-5308 …

…<ref>{{cite book | author = Christos Papadimitriou | title = Computational Complexity | publisher = Addison-Wesley | date = 1994年 | id = ISBN 0-201-53082-1}} Sec …ref>、[[囲碁]]（日本ルール）<ref>{{Cite book | author = J. M. Robson | chapter = The complexity of Go | title = Information Processing; Proceedings of IFIP Congress | date …

…name="jukna">{{cite book|last1=Jukna|first1=Stasys|title=Boolean Function Complexity: Advances and Frontiers|date=Jan 6, 2012|publisher=Springer Science & Busin [[Category:Circuit complexity]] …

'''通信複雑性'''（つうしんふくざつせい、Communication Complexity、'''CC'''）は、1979年に[[アンドリュー・チーチー・ヤオ]]によって導入された用語である。ヤオは2つの個体間の通信問題を研究していた。アリス * Kushilevitz, E. and N. Nisan. Communication complexity. Cambridge University Press, 1997. …

…Ketan D. | last1=Mulmuley | first2=Milind | last2=Sohoni | title=Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems | url=http://epu …son | first2=Avi | last2=Wigderson | title=Algebrization: A New Barrier in Complexity Theory | url=http://dl.acm.org/citation.cfm?id=1490272 | year=2009 | journa …

…in \mathcal{C} \times \mathbb{N} \left| \begin{matrix}\mbox{there exists a circuit } B \mbox{ with at most } k \mbox{ gates } \\ \mbox{ such that } A \mbox{… * C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994. Chapter 17. ''Polynomial hierarchy'', pp. 409&ndash; …

…or [[timbres]]), usually by using [[Nonlinearity|non-linear]] [[Electronic circuit|circuits]] or mathematics.<ref name="croads">Nb. Some authors refer to thes <!-- While some synthesis methods achieve sonic complexity by using many [[Electronic oscillator|oscillator]]s, [[distortion]] methods …

*'''サーキット''' ({{lang-en-short|circuit}}) - 極小な従属集合 …edu/~luca/cs172/karp.pdf Reducibility Among Combinatorial Problems] |title=Complexity of Computer Computations |editor=R. E. Miller and J. W. Thatcher eds |publi …

…ast 10 years. That means by 1975, the number of components per integrated circuit for minimum cost will be 65,000. I believe that such a large circuit can be built on a single wafer. …

|title=Quantum complexity theory …|title=Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics|doi=10.1038/nature02851|journal=Nature|volume=431|p …