Edit - Theoretical Computer Science Stack Exchange

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

7

$\begingroup$ No direct reason, but all known approaches (implementations of counting arguments) require that we eventually verify that the truth table of a given function has high circuit complexity. An $NE$ algorithm for this problem would define a $NP/poly$-natural property against $P/poly$ (which, according to one of Steven Rudich's papers, is unlikely). Of course, solving this problem looks unnecessary... $\endgroup$

Ryan Williams
– Ryan Williams

2011-02-24 03:58:53 +00:00
Commented Feb 24, 2011 at 3:58

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>
MathJax equations $\sin^2 \theta$

formatting help »
answering help »

MathJax help »