All Questions

Filter by
Sorted by
Tagged with
-1
votes
2answers
4k views

Compute Time Complexity of Neural network, SVM and other classification algorithms

I would like to know what is the asymptotic time complexity analysis for general models of Back-propagation Neural Network, SVM and Maximum Entropy. Does it just depend on number of features included ...
-1
votes
1answer
392 views

The existing bound on Edmonds-Karp doesn't seem to be tight

I'm reading CLRS's (Cormen et.a al) Introduction to Algorithm, and arrived at the maximum flow section. It shows that Edmonds-Karp algorithm runs in $O(E^2V)$ time by showing that: 1) If we let $\...
-1
votes
1answer
2k views

Decidability of the halting problem on finite computers [closed]

I've seen two competing and contrary arguments for this problem. One states that real computers are linear-bounded automata, and therefore the halting problem is decidable. The other states that ...
-1
votes
2answers
2k views

Determine if a LL(2) grammar is strong

Given a LL(2) grammar , how can i determine if it is strong ?
-1
votes
1answer
385 views

Locate “N Gram” substrings that are smallest distance away from a target string N character long

I am looking for an algorithm, or code, preferably in Python that would help me locate substrings, N characters long, of exisiting strings that are closest to a target string N character long. ...
-1
votes
2answers
571 views

Minimum spanning tree algorithm. [closed]

Is the following a valid algorithm for finding a minimum spanning tree? Given a weighted graph with unique weights, remove the all edges that are the highest cost edge in any cycle of the original ...
-1
votes
1answer
68 views

the shorstest cycle containing two given points

I am given a edge-weighted (multi)graph $G$ and two of its vertices, $u, v\in V(G)$. I want to find two edge-disjoint paths that connects $u$ and $v$ while minimizing the sum of the lengths of the ...
-1
votes
1answer
61 views

Chomsky-Schutzenberg Hierarchies explained for physicist (general) [closed]

I am classically trained in physics, however I have been interested in the use of information theory in studying some classical systems. As someone who is somewhat unfamiliar with the language of ...
-1
votes
1answer
94 views

What is the formal definition of a stacked based finite state machine?

The formal definition of a finite state machine is as follows: A FSM is a quintuple: ($I$, $S$, $S$0, $T$, $F$) $I$ - finite, non-empty input set $S$ - finite, non-empty state set $S$0 - initial state ...
-1
votes
1answer
83 views

Min Cut with Vertices

I have an undirected graph G with a set of vertices and edges. Each vertex has a weight w. Let's assume we have all vertices connected with some paths. I'm looking ...
-1
votes
1answer
54 views

NP-Complete graph problems where a special vertex is given as input?

I am currently working on a graph theory problem where the instance includes a graph and a special vertex in the graph. I am trying to prove the NP-completeness of the problem as well as explore ...
-1
votes
1answer
254 views

3-coloring graph zero-knowledge proof [closed]

I was researching about zero-knowledge proofs and in this link http://web.mit.edu/~ezyang/Public/graph/svg.html I've seen the exercise question: Currently, you can only select adjacent pairs of nodes ...
-1
votes
1answer
175 views

Is there a name for graph regions that lie between two nodes?

Perhaps a bit more formally, is there a name for regions delimited by nodes A and B, in a directed graph, where all paths starting from A, when prolonged, will eventually reach B, and all paths ...
-1
votes
2answers
108 views

Are there (N-1)! ways to order joins?

On page 2 of http://db.csail.mit.edu/6.830/lectures/selinger.ppt, there is the following text: How to order a series of N joins, e.g., A.a = B.b AND A.c = D.d AND B.e = C.f $N!$ ways to order joins (...
-1
votes
1answer
155 views

Given oracle for Max-3SAT compute clauses that cannot be satisfied

We know that Max-3SAT is NP-hard to compute exactly (and also hard to approximate to a particular constant multiplicative factor). However, suppose you are given an oracle for Max-3SAT that tells you ...
-1
votes
1answer
139 views

Can context-free grammar generates $a^{2^n}$ [closed]

Context-free grammar can generate the string $a^{2^n}$ for $n \geq 0$. The production rule P is $S \rightarrow SS | a$. The derivations is, for example: 1) $S \Rightarrow a$ (this is when n = 0) 2)...
-1
votes
1answer
78 views

For two representations of finite length of one computable number are there $P$-time algorithms that compute one from another

Any computable number may have different representations of finite length . For example,$\sqrt{2}$ may be represented as root of equation, or as a (shortest for a universal Turing Machine)program of ...
-1
votes
2answers
450 views

Complexity of problems solvable by primitive recursion

I was wondering if there is any known complexity of problem for which primitive recursive functions cannot solve. One such problem might be "is N the ackermann function for $k_1$ $k_2$" as it seems ...
-1
votes
1answer
844 views

What is the most efficient algorithm to generate a sequence of prime numbers?

I know about algorithms like Sieve of Eratosthenes and Sieve of Atkin for generating prime numbers. I would like to know what is the most efficient known algorithm to generate the sequence of $k$ ...
-1
votes
1answer
3k views

Program optimization - 90/10 law

I found this "law" somewhere on Wikipedia: In software engineering, it is often a better approximation that 90% of the execution time of a computer program is spent executing 10% of the code (known ...
-1
votes
2answers
1k views

Kripke model and LTL vs CTL formulae interpretation [closed]

I have this Kripke model $M$: $$ \begin{array}{ccccccc} \to & (p, q) & \to & (\neg p, \neg q) & \to & (p, \neg q) \\ & \circlearrowright & & & & \...
-1
votes
1answer
86 views

Issue in understanding conditional likelihood for a producton rule

The Equation1 in paper in link explains how to assign probability to a production rule. Fig1 explains with an example. Now, I have a problem in understanding how to work with this formula since it ...
-1
votes
1answer
323 views

Why don't chips switch to reversible computation model to save energy? [closed]

Reversible Computation Models at least do not consume energy, according to physical laws, since no information is erased. And there are also Fredkin Gate and Toffoli Gate which can effective simulate ...
-1
votes
1answer
397 views

comparing polyhedra (or even more specifically convex hulls) in d dimensions

Does anybody have information on whether the problem of determining whether 2 polyhedra in d dimensions are the same, is polynomial or NP-complete, if so? Thanks
-1
votes
1answer
322 views

Amortized Analysis [closed]

I have two questions. My book: "We must ensure that the total amortized cost of a sequence of operations provides an upper bound on the total actual cost of the sequence. This must hold for all ...
-1
votes
1answer
434 views

What are the applications of scene recognition algorithms? [closed]

One common application is for use with automatic mode cameras. They can recognize the scene categories and then adjust the camera parameters to take the best shot of the scene. I am wondering what ...
-1
votes
1answer
177 views

Conjecture about ASP reductions between NP-complete problems

$ASP$-complete reductions, introduced by Ueda and Nagao, relate the hardness of computational problems in $FNP$. Basically, $ASP$-reduction is a polynomial time reduction between instances and a ...
-1
votes
1answer
62 views

Example of Delaunay Triangulation where it does not minimize the maximum angle

I know that that the Delaunay triangulation maximizes the minimum angle of triangulation. And it does not minimize the maximum angle. If we consider the set of points in general position(no four ...
-1
votes
1answer
167 views

Evidence integer multiplication is in linear time?

After millenia of quest we have identified two $n$ bit integers can be multiplied in $O(n\log n)$ time. Please refer details in https://www.quantamagazine.org/mathematicians-discover-the-perfect-way-...
-1
votes
2answers
127 views

Hospital Resident Matching Algorithm with Incomplete Preferences

Consider a set of doctors $D$ and hospitals $H$ such that each doctor $d \in D$ has a rank ordered strict preference over a subset of hospitals, $H_d \subseteq H$. Similarly, each hospital $h \in H$ ...
-1
votes
1answer
127 views

Gödel-Numbering of the Context-Sensitive Languages

I would like to have a Gödel-numbering of the context-sensitive languages. Because there is no obvious syntactic distinction between LBAs and TMs, I cannot number the former in an immediate way. So I ...
-1
votes
1answer
58 views

How is additive error handled in this simple algorithm? 'Product of all elements'

Say we have two unit vectors $\hat{u}, \hat{v} \in \mathbb{R}^n$ where $\hat{u} = (u_1,...,u_n)$ and $\hat{v}$ approximates $\hat{u}$. $~\hat{v} = (u_1+\epsilon, ...,u_n+\epsilon)$ where $\epsilon = \...
-1
votes
1answer
63 views

Formally prove that the loops of this sorting algorithm will terminate [closed]

Given is the sorting algorithm Bubblesort ...
-1
votes
1answer
82 views

Restricted Universe Exact Cover

Apologies for a simple question - I am a beginning graduate student in TCS. Consider the following $\mathrm{ExactCover}$ problem: Given a collection $\mathcal{S}$ of subsets of a universe set $U$ and ...
-1
votes
2answers
704 views

Are these problems in NP class?

${\bf New\ version}$ [Version 1.2] Let $f: \mathbb{N} \to \{0,1\}$ be a computable function, ${\bf Fin}(\mathbb{Z})$ be the set of all finite subsets of $\mathbb{Z}$, and $W: {\bf Fin}(\mathbb{Z}) \...
-1
votes
1answer
115 views

Special cases of hard counting problems that are easy

We know that bipartite planar perfect matching count is easy, permanent mod $3^t$ is easy for orthogonal matrices, permanent mod $2$ is easy, bounded rank permanent is easy. Outside of permanent ...
-1
votes
1answer
95 views

What is the name of the category of problems that can only be solved with machine learning? [closed]

Wikipedia defines machine learning as the "field of computer science that gives computers the ability to learn without being explicitly programmed". A common example of a problem which machine ...
-1
votes
1answer
88 views

What is the relation between P-immune languages and NP-complete languages? [closed]

Can a NP-complete language be P-immune? Why can't existence of P-immune languages separate NP from P?
-1
votes
1answer
132 views

A conceptual question regarding hardness proofs by reduction [closed]

If we restrict the input domain of a known NP-hard problem P so that this restricted domain is equal to the input domain of another problem S, then show that we can reduce a solution to P given input ...
-1
votes
1answer
192 views

Can message passing help in GI related problems?

Can message passing algorithms like those used in https://arxiv.org/pdf/1704.00395.pdf be useful in showing GI testing is in P? Note message passing is prominent in AI and has been tried in decoding ...
-1
votes
1answer
277 views

What is the connection between adversarial learning in machine learning and program synthesis?

In particular, I'm considering the similarities in Generative Adversarial Networks and Combinatorial Sketching for Finite Programs. In the first paper, our concern is with learning generator ...
-1
votes
1answer
119 views

Global satisfiability in LTL

In propositional linear temporal logic (LTL) over $\mathbb{N}$, it is decidable whether a formula $\varphi$ is satisfiable from time point 0. Is it known to be un/decidable to check the ...
-1
votes
1answer
193 views

Reconstructing a 2D lattice graph from an unordered adjacency list

Is there any kind of algorithm that can map a set of points and their unordered adjacent neighbours to a 2D lattice graph that would then be addressable using X, Y coordinates? For example, given the ...
-1
votes
1answer
40 views

pseudo boolean modularity constraint?

I have a constraint like d >= a ^ b ^ c, where a,b,c,d are binary, ^ is XOR. Is this a pseudo boolean modularity constraint or not? Most Pseudo boolean modularity constraints I saw are with equality, ...
-1
votes
1answer
257 views

convertion into integer linear program for Ising spin state problem [closed]

I am trying to model the Ising spin state problem into Integer linear program and find the optimal ground state using lp_solve. (This is just a miniature version of Ising state problem) $$ maximise: \...
-1
votes
1answer
221 views

How is does a scheme lambda function relate to lambda calculus?

For example: (define fact (lambda (n) (if (< n 2) 1 (* n (fact (- n 1))))) How is this an example of applied lambda calculus? I tried to read the ...
-1
votes
1answer
1k views

How to XOR automata? [closed]

Say we have 3 DFAs. We know how to OR, AND, or NOT them. But how does one XOR them? There is not one single mention of this online. x XOR y XOR z = ((x|y)(~x|y)|z) (~((x|y)(~x|y))|z). This is way too ...
-1
votes
2answers
122 views

Looking for menu-driven coding editor based on a programming language state machine [closed]

I'd like to know whether an application development environment exists that uses a menu-driven coding editor that employs a programming language state machine. This would mean that commands, variable ...
-1
votes
1answer
456 views

Implementation of Kallmann's Dynamic Constrained Delaunay Triangulation algorithm

Does anyone know of any open source implementation (preferably in java) of Kallmann's DCDT algorithm? If there's another DCDT algorithm that has been implemented, that may work as well. I wasn't sure ...
-1
votes
1answer
255 views

Graph Isomorphism: Polynomial time reduction from GI for disconnected graphs to GI for connected graphs? [closed]

Let the Graph Isomorphism Problem be the problem to decide whether there is a one-to-one mapping between the vertices of two graphs that preserves the edge relations. Let the Graph Isomorphism ...

15 30 50 per page
1
206 207
208
209 210
216