Stackexchange - cstheory.stackexchange.com - Recent Questions - Theoretical Computer Science Stack Exchange
General Information:
Latest News:
Geometric Intuition behind Locally testable codes 27 Aug 2013 | 08:34 pm
Conventional coding theory provides a good geometric picture behind linear error correction codes in terms of Hamming distance. What additional geometric requirement one should add to make a code loca...
Multi target regression using neural networks in matlab 27 Aug 2013 | 07:15 pm
I am new to neural networks tool in matlab. I have a certain data with 100 features and 5 targets. I want to learn a multi target non linear function using neural networks in matlab. So given features...
what does the NFA for a language $\phi$ actually mean? 27 Aug 2013 | 06:13 pm
For some regex $R$, why is the construction of a NFA for $R = \phi$ (empty langauge) not have any accept states, This seems to be the construction of a NFA 'for' a language $\phi$ Intuitively, does i...
Counterexample for Corneil's efficient algorithm for Graph Isomorphism 27 Aug 2013 | 12:34 pm
In the paper An Efficient Algorithm for Graph Isomorphism by Corneil and Gotlieb, 1970 a conjecture was stated upon which the stated algorithm relied for solving GI in polynomial time. Namely: that t...
What is DDL (Data Definition Language)? 26 Aug 2013 | 08:29 pm
As a part of my curriculum, I am studying principles of DBMS from the book by Silberschatz and Korth. A part of it is about Data Definition Language (DDL). I understand, in normal terms, that DDL is...
Upper bound on the maxima of ratio of expectation of quantities under Gaussian measure [cross posted from mathoverflow] 26 Aug 2013 | 08:28 pm
I am cross-posting this question from mathoverflow. http://mathoverflow.net/questions/140407/upper-bound-on-the-maxima-of-ratio-of-expectation-of-quantities-under-gaussian-m Let $\lambda,\eta >0$ be ...
Bivariate low-degree polynomial testing of Polishchuk-Spielman 26 Aug 2013 | 10:02 am
In the seminal paper of Polishchuk and Spielman where they give a construction of nearly linear sized $PCP$ for an $NP$ problem, one of the key ingredients is a low-degree test for bivariate polynomia...
What's the meaning of "input size" for 3-SAT? 26 Aug 2013 | 05:49 am
In the computational complexity theory, we say that an algorithm have complexity O(f(n)) if the number of computations that solve a problem with input size n is bounded by cf(n), for all integer n, wh...
Finding assignment-minimum complete k-partite graph cover 25 Aug 2013 | 11:31 pm
Is there any work on approximation algorithms (or exact algorithms) for finding an assignment-minimum cover of an arbitrary graph using complete k-partite subgraphs? I'm assuming this problem is NP-h...
Quantum Computing and 3 square sums 25 Aug 2013 | 08:40 pm
Can the following problem be solved using a Quantum Computer in polynomial time: Find integers $(x_1,x_2,x_3)$ such that: $$x_1^2+x_2^2+x_3^2 = Q$$ Or respond with no solution: I legitimately no n...
