Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with boolean-functions
Search options not deleted
user 63140
Questions about Boolean functions and their analysis
2
votes
0
answers
100
views
Natural proofs and size of propositional formulas
Given a formula $\phi$ of propositional logic, we define its size $|\phi|$ as the number of proposition symbols that $\phi$ contains (counted with multiplicity). For example, $|(p \land p)| = 2$.
Let …
- 1,284
8
votes
Accepted
Complexity of computing minimum unsatisfiable core
Umans proved that a problem that he calls "succinct set cover" is $\Sigma_2^p$-complete [1]. In this problem we are given a DNF-formula with terms $T=\{t_1,\dots,t_m\}$ and a parameter $k$, the questi …
- 1,284