Hottest Questions This Month

16

votes

4

answers

3k

views

Algorithms Careers

modified Apr 28 at 3:57 Matthieu Latapy 533

10

votes

1

answer

702

views

Ambiguity of regular expressions

fl.formal-languages regular-expressions

modified Apr 18 at 21:15 Hermann Gruber 5,204

2

votes

2

answers

323

views

Proving not NP-complete by non-existence of gadget

np-hardness reductions

answered Apr 30 at 16:00 Joshua Grochow 34.3k

3

votes

1

answer

233

views

Proof and computational complexity

cc.complexity-theory reference-request lo.logic computability

modified Apr 17 at 21:07 Denis 6,910

2

votes

2

answers

155

views

Are there strongly normalizing lambda terms that cannot be given a System F type?

lambda-calculus typed-lambda-calculus

answered May 2 at 21:29 Damiano Mazza 4,393

3

votes

3

answers

184

views

Proving proof system properties within the proof system itself?

proofs proof-theory

answered May 5 at 14:30 Emil Jeřábek 13k

4

votes

1

answer

197

views

Complexity of relaxed edge colouring

cc.complexity-theory graph-theory np-hardness graph-colouring

modified Apr 13 at 13:50 Cyriac Antony 1,303

6

votes

1

answer

148

views

Is the function $f(a_1 \dotsm a_n) = a_1(a_1a_2)(a_1a_2a_3)\ \dotsm\ (a_1 \dotsm a_n)$ regularity-preserving?

automata-theory regular-language

modified Apr 16 at 12:32 Denis 6,910

4

votes

1

answer

148

views

Does such a bipartite graph exist?

graph-theory graph-algorithms co.combinatorics

answered Apr 27 at 15:40 Neal Young 6,703

3

votes

1

answer

121

views

Are uniqueness rules converse to introduction rules?

type-theory

modified Apr 29 at 11:11 ice1000 155

1

vote

1

answer

140

views

KRW Conjecture: separation of NC^1 and P

cc.complexity-theory complexity-classes boolean-functions boolean-circuits

modified Apr 11 at 21:15 StanleyIpkiss 13

4

votes

1

answer

60

views

Finding vertex separator such that the induced subgraph has minimal number of edges

graph-theory graph-algorithms np-hardness partition-problem max-flow-min-cut

answered 22 hours ago David Eppstein 49.7k

7

votes

1

answer

107

views

Is the following restriction of cellular automata / tile assembly / CRN a known model?

machine-models cellular-automata

answered Apr 15 at 14:41 Ilkka Törmä 456

2

votes

0

answers

248

views

The implication of $ S(SAT)=2^{\Omega{(n)}} $ Conjecture (5.7 in Wigderson Book)

cc.complexity-theory

modified yesterday Fares 21

-1

votes

1

answer

116

views

What are the known classes of undirected graphs such that every graph belonging to that class is guaranteed to have a Hamiltonian Path?

graph-theory hamiltonian-paths graph-classes

answered May 3 at 13:39 GMB 2,043

1

vote

0

answers

241

views

Is there a standard definition of resolution for arbitrary clauses?

proof-theory boolean-formulas resolution

asked Apr 14 at 18:17 ale64bit 265

1

vote

1

answer

110

views

Is this a weaker or stronger form of the halting problem

halting-problem

answered Apr 22 at 3:14 William Hoza 1,723

13

votes

0

answers

193

views

Is this problem on unambiguous finite automata NP-complete?

automata-theory np-complete

modified 8 hours ago M.Monet 1,085

-1

votes

0

answers

185

views

What progress has been towards $ZPL=L$?

cc.complexity-theory randomized-algorithms

modified Apr 23 at 0:53 1.. 11.6k

0

votes

0

answers

177

views

An $O(n^2\log^c{n})$ algorithm for matrix multiplication in this paper?

cc.complexity-theory matrix-product

asked Apr 22 at 9:50 Mengfan Ma 431

0

votes

0

answers

160

views

Understanding a conference reviewer comment

paper-review conferences

asked Apr 23 at 18:21 karmanaut 953

5

votes

0

answers

120

views

How to find the second smallest cut in a graph?

ds.algorithms graph-theory max-flow-min-cut

asked Apr 17 at 11:01 Akash Agrawal 51

3

votes

1

answer

153

views

What are some “must-read” papers for someone getting into Quantum Cryptography?

quantum-computing cr.crypto-security quantum-information

answered Apr 20 at 18:42 user3483902 1,013

3

votes

0

answers

152

views

HyperLogLog: Why “Hyper?”

ds.data-structures terminology

asked May 1 at 20:39 templatetypedef 1,851

4

votes

0

answers

148

views

What kind of research can be considered publishable for undergraduate or graduate students (MSc level)

soft-question cr.crypto-security advice-request career

asked Apr 24 at 22:59 h4lius 41

7

votes

0

answers

105

views

Decomposing graph homomorphisms

graph-theory homomorphism

modified Apr 12 at 12:50 Denis 6,910

7

votes

0

answers

127

views

Where is Yao's original proof that distinguishers imply next-bit-predictors?

reference-request ho.history-overview pseudorandomness pseudorandom-generators

modified Apr 22 at 2:05 D.W. 9,744

0

votes

1

answer

77

views

Reference for context-free grammar for Martin-Löf type theory

reference-request fl.formal-languages type-theory context-free

answered Apr 26 at 13:16 Neel Krishnaswami 30.6k

3

votes

1

answer

91

views

Hardness when restricted to an infinite number of far apart instance sizes

cc.complexity-theory reference-request

answered Apr 26 at 10:05 neinoa 11

-3

votes

0

answers

115

views

Are space and time hierarchies infitesimally graded?

cc.complexity-theory hierarchy-theorems

modified Apr 27 at 5:50 1.. 11.6k

-2

votes

1

answer

109

views

Where, if any, is there currently any research being done on the subject of ternary computers? [closed]

computability

modified Apr 27 at 17:48 Jake 192

3

votes

0

answers

104

views

Abstract stone duality and cohesive homotopy type theory

topology homotopy-type-theory stone-duality

asked Apr 18 at 2:53 Nift 579

1

vote

0

answers

101

views

Deterministic one way communication complexity for message with arbitrary length

it.information-theory communication-complexity complexity

modified Apr 10 at 2:10 Koko Nanahji 11

0

votes

1

answer

61

views

Why does LTL equivalence (with next oeprator) implie trace equivalence in finite transition machines?

linear-temporal-logic

answered Apr 20 at 6:05 Shaull 4,615

-1

votes

2

answers

57

views

Pi-type over a list in dependent type theory

type-theory dependent-type agda

answered Apr 29 at 12:39 ice1000 155

-1

votes

1

answer

56

views

What does x.y notation mean?

pl.programming-languages notation

answered 12 hours ago gasche 1,752

-3

votes

0

answers

91

views

When does complementariness imply lowness?

cc.complexity-theory complexity-classes

modified Apr 25 at 2:38 1.. 11.6k

1

vote

0

answers

85

views

Complexity of counting 3-colourings of planar bounded degree graphs

graph-theory counting-complexity planar-graphs graph-colouring bounded-degree

modified Apr 27 at 2:10 Cyriac Antony 1,303

-2

votes

1

answer

83

views

upper bound on the total number of fixed-length paths in an acyclic graph [closed]

graph-theory

modified May 2 at 0:06 Avi Tal 1,436

1

vote

1

answer

63

views

Covering a binary relation as a union of rectangles

np-hardness co.combinatorics set-cover bipartite-graphs covering-problems

answered Apr 30 at 5:13 Chris Culter 121

2

votes

0

answers

77

views

When did self-balancing binary search trees become known outside the soviet union?

ho.history-overview binary-trees

asked Apr 12 at 18:08 Mike Izbicki 1,043

3

votes

0

answers

74

views

Boltzmann sampling for containers/dependent polynomials?

co.combinatorics lo.logic type-theory dependent-type sampling

asked Apr 22 at 9:24 Neel Krishnaswami 30.6k

0

votes

0

answers

74

views

Existence of $\{0,1\}$-solution to a system of linear equations with coefficients in $\{0,1\}$

cc.complexity-theory co.combinatorics integer-programming combinatorics

modified Apr 25 at 13:46 Rodrigo de Azevedo 219

0

votes

0

answers

72

views

Kleisli-like category for applicatives?

functional-programming ct.category-theory monad applicative

asked Apr 22 at 20:09 Julian G. 1

2

votes

0

answers

67

views

SVM perturbation bounds

convex-optimization svm

modified May 5 at 18:56 Aryeh 9,088

1

vote

0

answers

64

views

Take a natural quotient of context-free grammars

fl.formal-languages context-free

asked 2 days ago naloa 41

3

votes

0

answers

57

views

Useful notion of ambiguous growing context-sensitive language

cc.complexity-theory fl.formal-languages grammars

asked May 6 at 14:51 naloa 41

3

votes

0

answers

57

views

Precise rank of a sparse integer matrix

linear-algebra sparse-matrix

asked Apr 13 at 16:17 Andrei Matveiakin 131

Top Questions

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