Find answers to your questions about Theoretical Computer Science or help others by answering their Theoretical Computer Science questions.
Consider the following computational problem, where $I$ is the real interval $[-1,1]$:There is a monotonically-increasing function $f: Ito I$. You are allowed to access it only through...
Asked on 10/30/2021
1 answerI hope that mathematical logic / recursion theory type questions are welcome here. I am sorry this question is so long and technical, but I believe that if you read...
Asked on 10/30/2021 by Gary Hoppenworth
1 answerOptimization problems of the type: minimize $c^T x$ subject to [maybe some linear constraints and] $||x||_0le k$ are known to be NP-hard. [Actually, I just realized that I...
Asked on 10/30/2021 by Aryeh
1 answerCompaction is a particularly weak form of sorting. The problem can be phrased as follows:Given an array $A$ of $N$ cells, with at most $R$ of the...
Asked on 10/30/2021
1 answerI want to know what is the best known lower time complexity of Succinct-CVP?The succinct version of many P-complete problems are EXP-complete and Succinct-CVP is EXP-complete too (It is...
Asked on 10/30/2021 by Mohsen Ghorbani
0 answerWhere to find info on (polytime) approximability of various discrete optimization problems? Sorry if this is stupid,but is there a site or reference that keeps up to date info...
Asked on 10/30/2021
2 answerIn this document https://courses.engr.illinois.edu/cs598csc/sp2010/Lectures/Lecture9.pdfthey prove the integrality of the matching polytope using the integrality of the perfect matching polytope. The only part I don't understand is...
Asked on 10/30/2021 by Karagounis Z
0 answerIn short we are interested in isomorphism preservingtransformation CNF to Graph. Let $phi_1,phi_2$ be CNF formulas. Define $phi_1$ and $phi_2$ to be isomorphic $phi_1 cong...
Asked on 10/30/2021 by joro
1 answerAssume we want to find the elements from a set of elements $mathscr{E}$ for which all predicates from a set of $n$ predicates $mathscr{P}$ evaluate to true....
Asked on 03/08/2021 by Bernardo Sulzbach
0 answerThe fundamental theorem of statistical learning gives an equivalence between uniform convergence of the empirical risk to learning in the PAC framework. I have only seen this stated in the...
Asked on 02/27/2021 by user27182
1 answerGet help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP