Search:  
Ans | A | Title
0 |   | Graph Isomorphism is in NP-Complete
0 |   | Recent theoretical and experimental results in QRAM?
3 | Y | Is this variation of TQBF still PSPACE-complete?
1 | Y | Complexity of testing if two sets of $m$ points in $\mathbb{R}^n$ ...
0 |   | Using Dependent Type Theory for Categories that are not LCCC
1 | Y | Common insights into hypothetical complexity of graph problems
1 | Y | Parameterized complexity of inclusion of regular languages
0 |   | Fischer and Rabin's theorem (1974) for theories of "addit...
1 | Y | Practical approaches to solving whether programs will halt
1 | Y | Functions that are Not Efficiently Computable but Learnable
0 |   | Diff Algorithms
0 |   | Approximating a monotone submodular function using a concrete cove...
0 |   | Generalized path cover problem in DAG
1 | Y | What is the VC dimension of Turing machines with specified maximum...
0 |   | Explicit Formula of Delsarte's Linear Programming Upper Bound ...
2 |   | Check the match of the maximum of each subset
1 | Y | What is the complexity of this graph problem?
0 |   | Specification using linear temporal logic
1 | Y | Is Eulerian Path (or Eulerian Cycle) definable in Monadic Second O...
0 |   | Choosing between block scope and function scope variables
0 |   | Hard instances in Impagliazzo's Heuristica
1 |   | Finding shortest path in weighted undirected graph with two costs ...
0 |   | Graph-related applications of the fast Fourier transform (and othe...
0 |   | Derivation for the Rubik’s cube algorithm
2 | Y | Are space and time hierarchies even comparable?
0 |   | Problem: Scheduling diverse teams while minimizing frequency
0 |   | What is the name of this algorithm which is constantly running?
1 |   | Algorithm to compute distance between powers
1 | Y | Bouziane’s transformation of the Petri net reachability problem ...
0 |   | Printing all paths of a tree and sorting the weight of edges
2 | Y | Applications of Quantum Walks?
0 |   | Prove that an undirected graph of bn + c vertices such that for so...
0 |   | Could f(xyz)=π be used on a 3D plane instead of using a complex p...
1 | Y | Tight VC bound for agnostic learning
0 |   | Scaled down and scaled up versions of Impagliazzo-Wigderson Therem
1 | Y | Why isn't it trivial to map classical physical models into Spi...
0 |   | Is there a complete and finite axiom scheme for conditional indepe...
1 | Y | What is the name of this algorithm on direct acyclic graph?
2 | Y | How to translate general recursion into a set of $\mu$-recursive o...
0 |   | Partitions of regular graphs with upper bounds on bipartition width
0 |   | Optimal partition according to partition cardinality
6 | Y | Ternary (and beyond) computation and quantum computing?
3 | Y | Beating naive dynamic programming: examples similar to integer par...
1 | Y | Complexity of propositional LTL with past operators and freeze qua...
0 |   | Can Kolmogorov Incompressibility Theorem be applied to all type of...
0 |   | Complexity of Quadratic Programming
2 | Y | Proper PAC learning VC dimension bounds
2 | Y | Is an NP-hardness proof of an NP-hard problem considered a contrib...
0 |   | After training an RBM, can you use the hidden layer as a hidden la...
1 | Y | Searching for the original definition of online algorithms
Back