Search:

Ans | A | Title  0 |   | In the Hott book, are the most of the type formers redundant? And ...  0 |   | Set of total functions is countable for non-equivalent turing mach...  1 | Y | How fine-grained can the time hierarchy theorem be in a reasonable...  9 | Y | Is there any book on the philosophical implications of Theoretical...  0 |   | Is there way to estimate how old is a startup given a number of ti...  0 |   | Relation Between Mathematical Axioms and Computational Complexity ...  0 |   | Lower bound on the complexity of projection onto simplex?  1 | Y | Binary vector $t$ in $span(S)$ over $\mathbb{Z}/q\mathbb{Z}$ for a...  0 |   | Are there wholistic models of the universe in terms of Quantum Com...  0 |   | exact cover problem with Simulated annealing or genitics algorithms  1 | Y | Functions that are Not Efficiently Computable but Learnable  1 | Y | NP-hardness of finding 0-1 vector to maximize rows of {-1, +1} matrix  0 |   | Proof of Majority is stablest in "reverse" in the MAXCUT...  5 |   | Can neural networks be used to devise algorithms?  0 |   | Möbius values of CNF and DNF lattices of a monotone Boolean f...  1 | Y | Is $CAPP \in P$ known to collapse some quantum complexity classes ...  0 |   | What would be implied regarding P and NP if a P-complete was shown...  0 |   | Non-Uniform Classes of Languages not Closed Under Complement  1 | Y | What do stronger circuit lower bounds give in terms of derandomiza...  3 | Y | Is Biological Computation a theme covered by the Theoretical Compu...  0 |   | size of the induced matching  2 | Y | Space efficient "industrial" unbalanced expanders  2 | Y | Yao's Minimax Principle on Monte Carlo Algorithms  1 |   | Buckets in Hopcroft-Ullman analysis of Union-Find  0 |   | Confusion about "moves" in the valency argument for cons...  2 |   | Complexity of a variant of partition problem  1 |   | Continous work distribution algorithm with failover  1 |   | Does crossover take the parents or the offsprings? How to select p...  1 | Y | Difference between weak duality and strong duality?  1 | Y | Does Kannan's theorem imply that NEXPTIME^NP ⊄ P/poly?  0 |   | Are one way functions and pseudorandom number generators necessary...  0 |   | Quantum computing  0 |   | Maximum weight non-overlapping paths in a DAG  0 |   | Minimum cut on a directed graph with negative term  1 |   | Is there a P-complete problem on diophantine equations?  1 | Y | The Maxwell's Demon and Computer Science  1 |   | Knapsack with dependent profits (pairs of items)  2 | Y | Reference Request: complexity results on finding $(1+\epsilon) \lo... 4 | Y | Chaos and the$P{=}NP\$ question  0 |   | Approximating max coverage problem with slightly more than K sets  1 |   | Distributing a binary relation into bins such that each element is...  1 | Y | Understanding the No Free Lunch Theorem  1 |   | Suggested approach to cover data structure literature  0 |   | Frequency-Count List Accessing Algo - Why free transpositions?  2 | Y | Program equivalence wherein the programs are known to always halt  2 | Y | How to solve the Shortest Hamiltonian Path problem on Sparse Graphs?  1 |   | Could computers calculate time before it happens in the future?  1 |   | Automated proving that a program doesn't halt  0 |   | Minimal Cost of Eulerian Path  1 | Y | What is "Effects" in Program Graph?
Back