Hottest Questions Today

0 votes

0 answers

14 views

What is the exact difference between PUT and POST HTTP methods? [closed]

computer-networks applications

fatboyjapani

1

modified 2 hours ago

-2 votes

2 answers

47 views

Java | If a=250, b=3, c=(a + b/2)/b * b, Why doesn't c equal 251 but rather 249?

user19121278

31

modified 12 hours ago

1 vote

0 answers

22 views

Search algorithm with at most a constant $k$ failed accesses

algorithms runtime-analysis search-algorithms

user1231231hd

11

modified 12 hours ago

1 vote

1 answer

17 views

Finding bits per address in memory

computer-architecture

Yuval Filmus

269k

answered 14 hours ago

1 vote

1 answer

73 views

Covering all colors with unit intervals

algorithms np-complete np-hard

Steven

22.8k

modified 9 hours ago

0 votes

0 answers

21 views

How to solve Advanced Databases Exercises [closed]

database-theory

dennod

1

asked 16 hours ago

0 votes

0 answers

12 views

Pipeline and interrupts

assembly mips

Pol

1

asked 14 hours ago

-2 votes

0 answers

13 views

Calculating augmenting graph for anti parallel edges

network-flow

nick shetty

5

asked 18 hours ago

0 votes

0 answers

14 views

Circuit Complexity of Permutation

complexity-theory circuits permutations

random.cs.guy

101

modified yesterday

0 votes

0 answers

14 views

Expressing polynomial time in terms of first order logic

polynomial-time first-order-logic

dnaiel

23

asked yesterday

0 votes

0 answers

22 views

If verify() -> valid, then validate() -> what?

terminology

Akira

101

modified yesterday

1 vote

1 answer

28 views

MAX-SAT 2-Approximation algorithm

approximation sat-solvers maxsat

Tom Finet

238

modified yesterday

0 votes

1 answer

23 views

Finding smallest triangle to fit all points

computational-geometry data-sets euclidean-distance

Yves Daoust

3,437

answered yesterday

0 votes

1 answer

28 views

Interpreting the time complexity of a program from function

algorithms runtime-analysis

Yves Daoust

3,437

answered yesterday

0 votes

0 answers

16 views

Avoid for-loops in numpy calculation [closed]

matrices linear-algebra mathematical-programming

Frank Seidl

111

asked yesterday

0 votes

0 answers

18 views

Does MFLO instruction in MIPS causes conflict?

assembly mips

Pol

1

asked yesterday

-2 votes

1 answer

45 views

Approximate x*(a/b)^(c/d) using integer arithmetic only (assembler)

approximation arithmetic integers assembly

D.W.♦

140k

answered 2 days ago

0 votes

0 answers

16 views

Correctness implication graph for 2-sat

satisfiability correctness-proof 2-sat

heythere

11

asked yesterday

2 votes

1 answer

51 views

Solution Verification: How does the postorder traversal of a BST change after rotating left?

data-structures binary-trees binary-search-trees tree-traversal

John L.

33.2k

answered 14 hours ago

-2 votes

1 answer

27 views

determining the relationship between two regular languages using the myhill nerode theorem

regular-languages automata

Hendrik Jan

27.2k

answered 2 days ago

0 votes

1 answer

33 views

Determine if string can be constructed from given building blocks

algorithms strings

gnasher729

24.9k

answered 2 days ago

4 votes

2 answers

478 views

Spanning tree - minimum difference between smallest and largest weight

graphs minimum-spanning-tree spanning-trees

Steven

22.8k

modified May 24 at 18:08

1 vote

1 answer

43 views

Why is the certificate version of NP so ubiquitous?

complexity-theory knowledge-representation

mikinty

89

answered May 26 at 6:42

1 vote

1 answer

30 views

A red-black full tree where every black node has at most 1 red child has at most (n-1)/4 red nodes

data-structures red-black-trees

John L.

33.2k

modified 2 days ago

1 vote

0 answers

14 views

Long and short memory in reinforcement learning Connect 4 AI

neural-networks python game-theory reinforcement-learning board-games

Saguro

11

modified yesterday

-2 votes

0 answers

23 views

Moore law prediction

computer-architecture computation-models cpu

AHF

83

asked 2 days ago

1 vote

1 answer

55 views

Exact formulation of definition of $NP$, in relation to $R$

complexity-theory turing-machines polynomial-time nondeterminism recursively-enumerable

John L.

33.2k

modified 2 days ago

0 votes

1 answer

36 views

Does a closed formula exist for each recurrent formula?

recurrence-relation recursion

Yves Daoust

3,437

modified 2 days ago

1 vote

1 answer

18 views

Proving that the greedy algorithm for job scheduling has a 2 - (1/m) approximation ratio

approximation greedy-algorithms

John L.

33.2k

answered 2 days ago

-2 votes

0 answers

18 views

SQL query problem: Only first 3 active affiliate commision out of 10000 recruits is calculated and only for first 3 sales from each recruits?

data-structures databases python java c

pearlzil

1

asked May 26 at 3:11

1 vote

1 answer

48 views

Enumerating through Turing Machines That Solve Same Problem

complexity-theory turing-machines computability enumeration 3-sat

Moslem

629

answered May 25 at 5:08

0 votes

0 answers

83 views

DenseSet with at most k subset [closed]

np-complete clique

seboll13

40

modified May 25 at 9:06

0 votes

0 answers

37 views

I need to show that the problem is NP-complete

complexity-theory np-complete satisfiability 3-sat

Jay

21

asked May 25 at 13:29

3 votes

0 answers

23 views

Polynomial multiplication in finite field without smooth-order roots of unity

runtime-analysis polynomials fast-fourier-transform

Mathdropout

43

asked May 25 at 19:58

0 votes

0 answers

47 views

Complexity of finding the kth smallest element of all the elements in two order statistics binary search trees

time-complexity binary-search-trees

Neel Karia

1

modified May 25 at 8:57

-1 votes

0 answers

26 views

how would i reduce from 3sat

complexity-theory graphs np-complete 3-sat

Jay

21

asked May 25 at 14:22

-1 votes

1 answer

18 views

How to prove non-regularity with Myhill-Nerode theorem?

regular-languages

Kelly Bundy

334

answered May 25 at 20:45

0 votes

1 answer

274 views

Sets of problems in different models of computation and cardinality

turing-machines computability finite-automata pushdown-automata infinity

John L.

33.2k

modified May 23 at 1:38

2 votes

1 answer

16 views

Graph Layout Algorithm that optimizes only `x` (not `y`) of nodes?

graphs

D.W.♦

140k

answered May 25 at 18:16

2 votes

0 answers

16 views

Algorithm to find best alignment of one curve onto another

image-processing pattern-recognition

Chris Gnam

21

asked May 25 at 17:45

3 votes

1 answer

62 views

Lamport Timestamps and Causality

distributed-systems partial-order ordering consistency-model

John L.

33.2k

answered May 23 at 21:59

6 votes

8 answers

3k views

Advantages of linked lists over arrays?

linked-lists

ratchet freak

4,108

modified May 16 at 11:39

0 votes

0 answers

17 views

Learner Algorithm Time & Sample Complexity

time-complexity machine-learning probabilistic-algorithms

MathCurious

221

modified May 25 at 10:33

1 vote

1 answer

95 views

Proving transitivity in an intuitionistic type theory without the K rule

type-theory functional-programming dependent-types proof-assistants agda

Dan Doel

2,050

answered May 23 at 2:16

-1 votes

0 answers

18 views

Computer Architecture MIPS assembler with predictors

computer-architecture operating-systems assembly mips

Pol

1

asked May 25 at 0:00

-2 votes

0 answers

34 views

How to convert regular expression to context free grammar (b + £)(ab)aa(ba)(b + £)+(a + £)(ba)bb(ab)(a + £) [duplicate]

automata context-free regular-expressions

Abdelrahman Ahmed

1

modified May 24 at 16:14

0 votes

0 answers

24 views

How will changing the splitting point in merge sort affect the algorithm and its time complexity

time-complexity mergesort

Xenotion

1

modified May 24 at 16:51

Top Questions

Looking for more? Browse the complete list of questions, or popular tags. Help us answer unanswered questions.