Scholar - Badge - Computer Science Stack Exchange

Scholar

Ask a question and accept an answer.

Awarded 11499 times.

Creative solving of searching redundant connection in graph

Awarded Jun 9 at 11:05

bazylevnik0

234 bronze badges

What happens if we remove the length condition on the pumpable part in the pumping lemma for context free languages?

Awarded Jun 8 at 5:08

dvox

133 bronze badges

if P = NP, does it mean that P = NP = NP-complete?

Awarded Jun 7 at 14:56

Shy Cohen

232 bronze badges

Is this grammar LL(1) and what is it's parsing table?

Awarded Jun 6 at 20:18

Ian Rehwinkel

1033 bronze badges

How to visualize 1 pixel?

Awarded Jun 6 at 11:40

Splendid Digital Solutions

1054 bronze badges

is the class NP closed under set difference?

Awarded Jun 6 at 10:10

Skynet

534 bronze badges

Finite State Machine without recursion

Awarded Jun 4 at 22:28

Synesso

1234 bronze badges

What's the difference between "convex/non-convex optimization" and "quadratic programming"?

Awarded Jun 4 at 6:50

Vee Amona

32 bronze badges

Linear algorithm for off-line minimum problem

Awarded Jun 2 at 12:09

emptysamurai

1133 bronze badges

How Can the Bounded Search Tree Algorithm for Closest String run in $\mathcal{O}(kd)$ per node?

Awarded Jun 1 at 16:25

LemongrabThree

234 bronze badges

Selecting a submatrix of a binary matrix NP hard?

Awarded May 31 at 22:08

D. Sena

232 bronze badges

Generalizing Matrix Chain problem: optimal summation in a tree

Awarded May 30 at 18:26

Yaroslav Bulatov

2012 silver badges12 bronze badges

NP-completeness of problem based on non-arbitrary instance

Awarded May 30 at 18:17

pcko1

1135 bronze badges

Are "computable problem" and "computable function" the same thing?

Awarded May 30 at 5:06

Sanyo Mn

1835 bronze badges

NP-completeness of graph problem

Awarded May 29 at 23:42

girish

32 bronze badges

Queries to count points lying on arbitrary line

Awarded May 29 at 15:06

bihariforces

1053 bronze badges

How can I track multiple shortest paths from one node to another using Dijkstra / Bellman-Ford

Awarded May 29 at 13:12

ViktorMaksimoski

31 bronze badge

Markov algorithm for words of the form $ww$, $w\in \{a,b\}^*$

Awarded May 28 at 5:36

aassegai

132 bronze badges

Vertex Cover on Comparability Graphs

Awarded May 27 at 1:17

Henning Koehler

1514 bronze badges

Is there an AI that can play "One of these things is not like the other" (Sesame Street)?

Awarded May 26 at 16:49

ControlAltDel

1032 bronze badges

Why do simple Logical Gates have an Irrational amount of Bits?

Awarded May 25 at 22:07

G S

133 bronze badges

The Kleene–Rosser paradox and the inconsistency of lambda calculus

Awarded May 25 at 22:02

Fernando Chu

1333 bronze badges

Given an array of size $n$, return a sorted array of floor($n^k$) elements for some $k<1$

Awarded May 25 at 6:56

LearningSomeone

134 bronze badges

What are the sizes of 'functions' and 'fields' in the context of input to a decision problem?

Awarded May 24 at 3:46

Phillip Feldman

132 bronze badges

Linear-time constant-space 1/2-approximation algorithm for the maximum subset sum problem

Awarded May 23 at 14:21

asparagus

435 bronze badges

But why *is* $FPT$ a subset of $W[1]$?

Awarded May 22 at 19:50

moxx

655 bronze badges

Construct this two-taped Turing Machine {(u#,v#):u,v E {a,b}* , |u| = 2|v|}

Awarded May 19 at 6:57

Jeffrey Hennen

293 bronze badges

How can a Machine Learning model predict this classification problem?

Awarded May 17 at 17:26

Z Bokaee

132 bronze badges

can you read and push different symbols in a DPDA?

Awarded May 17 at 7:51

ee ss

32 bronze badges

P/poly and dyadic oracle

Awarded May 16 at 22:16

dino-t

233 bronze badges

Is there a non bruteforce apporach to solving a "synergistic knapsack"?

Awarded May 15 at 19:58

second_and_third_breakfast

33 bronze badges

Why is computing $e^x$ faster than computing $2^x$?

Awarded May 14 at 15:11

The Empty String Photographer

1295 bronze badges

Are there any radical approaches in CPU development?

Awarded May 14 at 14:36

cpuObtainer

12 bronze badges

What is the complexity of theorem proving?

Awarded May 14 at 0:52

Otakar Molnár López

834 bronze badges

Comparisons using Quicksort with the median as the pivot

Awarded May 13 at 17:18

FD_bfa

1036 bronze badges

Sequent calculus and vs comma: $a \land b \implies ...$ vs $a, b \implies ...$

Awarded May 13 at 16:06

dgan

1233 bronze badges

Densest Sub Graph and forbidden Pairs

Awarded May 13 at 10:36

Daniel Schwegler

133 bronze badges

Prove $a^nb^{n^2+n}$ is not regular by the pumping lemma

Awarded May 12 at 18:50

Papa

Efficient ways to sort pairwise distances for set of points in Euclidean space?

Awarded May 11 at 14:41

Bazza

132 bronze badges

How can I calculate the effective bandwidth of a memory system?

Awarded May 11 at 14:17

PintSizeSlash3r

334 bronze badges

Finding maximum via sum oracle

Awarded May 10 at 16:55

QNA

1335 bronze badges

Data structure for querying maximum of a rolling total

Awarded May 10 at 16:20

Vladislav Bezhentsev

4892 silver badges8 bronze badges

Finding pixel closest (grid points) to rectilinear polygons

Awarded May 10 at 16:03

kil47

33 bronze badges

Does Sipser's _Introduction to the Theory of Computation_ cover the Chomsky hierarchy?

Awarded May 10 at 10:51

Sam

1234 bronze badges

Is the following binary quadratic integer programming NP-Hard？

Awarded May 10 at 4:51

OvinaSun

233 bronze badges

Does my finite state automaton accept a string iff it contains the given string as a substring?

Awarded May 9 at 3:36

ZarakshR

1253 bronze badges

Linear-time algorithm for determining the presence of incomparable pairs in a directed acyclic graph (DAG)

Awarded May 7 at 16:21

Johntrik

438 bronze badges

What is lambda caculus's "fix point combinators" corresponding to Turing Machine?

Awarded May 6 at 3:10

wang kai

1212 bronze badges

Showing there exists a polynomial-time algorithm for deciding the existence of a linear classifier

Awarded May 5 at 20:33

automatically

115 bronze badges

Merge K BST of N elements in total into a single RBT in O(N log K) time

Awarded May 5 at 15:10

Alon .G.

132 bronze badges

Is this PDA correct or an erratum? (Sipser example 2.14)

Awarded May 5 at 15:05

nimo959

32 bronze badges

SAT polynomial time

Awarded May 5 at 14:32

Jip Helsen

1035 bronze badges

Unions of PSPACE-comlete problems that are PSPACE-complete?

Awarded May 3 at 6:57

Daniil Kozhemiachenko

1135 bronze badges

How is a direct address table different from an array?

Awarded May 2 at 18:27

Neel Sandell

1616 bronze badges

Is there a algorithm to determine if a regular language (expression) is subset of another?

Awarded May 1 at 19:45

skyking

1233 bronze badges

Product Construction for DFAs with different alphabets

Awarded Apr 30 at 15:06

revision

234 bronze badges

Automated theorem provers using models

Awarded Apr 29 at 10:36

Julien Narboux

1134 bronze badges

Balanced Directed Graph Realization

Awarded Apr 29 at 4:49

Helpful

1032 bronze badges

Is any 2-CNF has 2-DNF representation?

Awarded Apr 27 at 23:33

FirePapaya

1033 bronze badges

Confusion with Execution of NDFA

Awarded Apr 27 at 22:38

Abced Decba

1132 bronze badges

Prev 1 2 3

…

192 Next