Movatterモバイル変換

Question 1

-1votes

0answers

34views

Is it valid to compare solving vs checking NP problems using average time per logical step?

I’ve been exploring a measurement approach for NP and NP-complete problems based on average time per logical step.I define:...

Israeli Ochimnai

1

asked9 hours ago

Question 2

0votes

0answers

29views

Is Exact Matching with more than two colours NP-hard?

I'm interested in the following problem: given a (multi-)graph with each edge coloured by one of 3 colours, find a perfect matching with exactly k_i edges of colour i in {1,2,3}. I'm also interested ...

J. Schmidt

353

asked20 hours ago

Question 3

1vote

1answer

112views

Complexity of $Th(\langle \mathbb{Z}; + , 1 \rangle)$ same as $Th(\langle \mathbb{Z}; + \rangle)$?

I want to know a lower bound for the complexity of the decision problem for $\langle \mathbb{Z}; + \rangle$. The below paper notes that Presburger arithmetic, originally $\langle \mathbb{N}; +\rangle$,...

Learner of math

287

asked2 days ago

Question 4

2votes

0answers

23views

Does the Interior Point Method Solve Klee-Minty Cubes adversarial instances in Polynomial Time?

I am a network engineer currently studying optimization problems. Out of curiosity, I was fascinated by the fact that the Simplex Method has an exponential worst-case complexity, a property famously ...

Tuong Nguyen Minh

245

askedNov 14 at 23:39

Question 5

0votes

0answers

38views

Is vertex enumeration preferable to the simplex method in linear programming for finding all basic feasible solutions?

ContextI'm studying linear programming and trying to understand when different solution methods are most appropriate.I understand that the simplex method is generally better than vertex enumeration ...

Natch

83

askedSep 30 at 11:01

Question 6

5votes

2answers

641views

Proof that NP is a subset of EXP

I would like to clarify a misunderstanding I have about the proof that all NP problems can be solved in exponential time. The argument as I understand it is that you can simply test all possible ...

fern

319

askedSep 19 at 0:19

Question 7

1vote

0answers

110views

Where is the relativized uniform complementor on r.e. indices stated explicitly (index-operator form)—existence for $\emptyset'$ and any minimality?

Let $\langle W_e : e\in\mathbb{N}\rangle$ be the standard effective enumeration of recursively enumerable (r.e.) sets, where$$n\in W_e \;\Longleftrightarrow\; \exists s\;\big(\varphi_e(n)\ \text{...

John Jenkins

31

askedSep 12 at 9:03

Question 8

0votes

1answer

46views

Prove Big Theta for degree p polynomial

GoalProve that $f(n) = a_pn^p + a_{p-1}n^{p-1} + ... + a_1n + a_0$ is $\Theta(n^p)$IssueI am having trouble proving $f(n)$ is $\Omega(n^p)$. I know I need a $c_0$ and $k$ such that $f(n) \ge c_0n^p$...

Kungfunk

35

askedSep 10 at 18:34

Question 9

3votes

2answers

182views

Solving a general 1st order ODE with a series expansion

I am interested in solving the general Cauchy problem:$$\begin{cases}\frac{dx}{dt}=f(x, t) \\ x(t_0)=x_0\end{cases}$$computationally. Of course, I know there are plenty of well-established methods ...

Lagrangiano

241

askedSep 6 at 9:56

Question 10

6votes

0answers

294views

How does this algorithm "rank" amongst other in the literature?

By merging together the contributions from: a) this answer, b) the comments under this answer, we come up to the following:Claim. For $n\in\mathbb N$, let $Q=(\{1,\dots,n\},*)$ be a quasigroup. Then, ...

Kan't

5,601

askedSep 4 at 13:54

Question 11

4votes

1answer

222views

Subgroup test runtime

In case of a finite subset of a group, the subgroup test boils down to showing that the subset is closed under the group operation. This holds, in particular, for the subsets of a finite group.Q. ...

Kan't

5,601

askedAug 31 at 15:31

Question 12

1vote

0answers

52views

Prove that the zig-zag product of $G$ and $H$ (where $H$ is the smaller of the two) lifts $H^2$

Prove that the zig-zag product of $G$ and $H$ (where $H$ is the smaller of the two) lifts $H^2$.I was reading Expander Graphs and their Applications (Lecture notes for a course by Nati Linial and ...

Raheel

1,811

askedAug 28 at 9:24

Question 13

2votes

0answers

181views

Transitivity check runtime

A necessary condition for a subset $\Sigma\subseteq S_n$ to be a transitive permutation group of order $n$, is to be... transitive. Is the best algorithm to check $\Sigma$'s transitivity faster than ...

Kan't

5,601

askedAug 23 at 8:23

Question 14

2votes

1answer

99views

Polynomial-Time Algorithms for Canonical Form of Ternary Matrices under Row/Column Permutations and Column Negations

We study equivalence classes of ternary matrices of size $m\times n$, where equivalence is defined via row permutations, column permutations, and negation of entire columns. Our goal is to define and ...

fgrieu

1,860

askedAug 22 at 10:05

Question 15

0votes

0answers

53views

Can Nested tuples error calculation be improved by using complex numbers?

Hi I am trying to improve my error function . I have some data that is in form of nested tuple. These tuple nesting is base on importance of the data (all the lowest depth data is in as real numbers)....

ks 109

19

askedAug 6 at 0:31

Movatterモバイル変換

Stack Exchange Network

Questions tagged [computational-complexity]

Is it valid to compare solving vs checking NP problems using average time per logical step?

Is Exact Matching with more than two colours NP-hard?

Complexity of $Th(\langle \mathbb{Z}; + , 1 \rangle)$ same as $Th(\langle \mathbb{Z}; + \rangle)$?

Does the Interior Point Method Solve Klee-Minty Cubes adversarial instances in Polynomial Time?

Is vertex enumeration preferable to the simplex method in linear programming for finding all basic feasible solutions?

Proof that NP is a subset of EXP

Where is the relativized uniform complementor on r.e. indices stated explicitly (index-operator form)—existence for $\emptyset'$ and any minimality?

Prove Big Theta for degree p polynomial

Solving a general 1st order ODE with a series expansion

How does this algorithm "rank" amongst other in the literature?

Subgroup test runtime

Prove that the zig-zag product of $G$ and $H$ (where $H$ is the smaller of the two) lifts $H^2$

Transitivity check runtime

Polynomial-Time Algorithms for Canonical Form of Ternary Matrices under Row/Column Permutations and Column Negations

Can Nested tuples error calculation be improved by using complex numbers?

Hot Network Questions

Subscribe to RSS