# Questions tagged [computational-complexity]

This is a branch that includes: computational complexity theory; complexity classes, NP-completeness and other completeness concepts; oracle analogues of complexity classes; complexity-theoretic computational models; regular languages; context-free languages; Komolgorov Complexity and so on.

**0**

**0**answers

### Complexity theory on graphs

**2**

**1**answer

### Fast inverse of asymmetric diagonally dominant matrix with diagonal 1 and non-positive off-diagonals

**1**

**0**answers

### Does fraction-free Gaussian elimination use fractional row operations?

**0**

**0**answers

### Exact Gaussian elimination of a rational matrix

**0**

**0**answers

### A sub-logarithmic complexity in Analysis and N.Th

**8**

**0**answers

### Size of 3-SAT assignments

**0**

**0**answers

### 3-SAT family with $\omega(n^2)$ time complexity

**0**

**0**answers

### Reduce a recursively enumerable set to a recursive one not too sparsely

**2**

**1**answer

### Family of PTIME sets where it is hard to name elements

**0**

**0**answers

### On a deterministic primes search problem

**14**

**2**answers

### Kolmogorov complexity of classical music

**1**

**0**answers

### Minimum size of a Diophantine equation detecting the emptiness of a recursive set

**4**

**0**answers

### Determine the minimal elements of a Dynkin system generated by a finite set of finite sets

**13**

**3**answers

### Undecidable infinite analogs of NP-complete problems?

**0**

**1**answer

### Computationally intractable orbit of a monoid action on a finite set

**1**

**1**answer

### Counting $\mathrm{mod}\:p$ solutions of Diophantine equation in two variables taking $O(p^2)$ time

**0**

**1**answer

### Is minimum weight vertex cover problem NP-easy? [closed]

**0**

**0**answers

### Can it be decided in advance if the relaxed (non-integer) solution of a integer program will result in low error when rounded?

**4**

**1**answer

### Is it intractable to locate a sequence of prime/not-prime bits?

**1**

**0**answers

### Literature about graph isomorphism and incidence matrix [closed]

**5**

**2**answers

### Complexity of rectangular matrix multiplication

**2**

**0**answers

### How to decide if an algebraic number is a root of a given polynomial?

**3**

**1**answer

### Is factorial computation known to be in a class smaller than $FEXP$?

**1**

**1**answer

### Complexity of games with graph classes

**1**

**0**answers

### Maximum independent set in dense graphs

**0**

**0**answers

### Efficient Algorithm to Find Subset of Vectors Over $\mathbb{F}_q$ Living in Low Dimensional Subspace

**6**

**1**answer

### $\mathit{NP}$-hard statements which are $\mathit{NP}$-complete under the Riemann Hypothesis

**3**

**1**answer

### What is the computational cost in a neural network?

**2**

**0**answers

### Polynomial-time algorithm for uniformly sampling the $n$-slice of a context-free language

**1**

**0**answers

### Langlands program and complexity theory

**1**

**1**answer

### What is this invariant graph?

**7**

**1**answer

### Metric TSP with integer edge cost

**2**

**0**answers

### Complexity of Quadratic Programming where the symmetric matrix Q is positive semidefinite only in the feasible directions

**0**

**1**answer

### How hard is a linear programming with a bounded constraint?

**7**

**0**answers

### Zero-knowledge proofs for answers to the $P=NP$ question

**0**

**1**answer

### What are the odds for a random collection of numbers to have sum less than a certain number?

**0**

**0**answers

### Logical operations expressed as polynomials

**6**

**0**answers

### Certificate for computation of ideal class group

**4**

**0**answers

### Algorithms to factorize words into product of powers

**1**

**0**answers

### Subgraph isomorphism problem with linear map

**1**

**0**answers

### Reporting uncoverable directed simple cycles in digraphs

**1**

**1**answer

### Could somebody suggest a way to determine if a parallelogram contains another parallelogram?

**1**

**0**answers

### Computational complexity of rate $\frac{1}{2}$ codes

**1**

**0**answers

### Promise version of minimum distance

**0**

**0**answers

### Time complexity of asymmetric sums of divisor function

**2**

**1**answer

### The complexity of expansion ratio (Cheeger constant) of a graph

**1**

**0**answers

### Counting $\bmod 2$ number of vertices of sparsely represented polyhedra

**3**

**0**answers

### Modular counting of integral points under sparse non-negativity

**4**

**1**answer

### Finding a binary variable assignment to make a matrix with variables singular (over F_p)

**0**

**0**answers