Theoretical Computer Science Stack Exchange

4

votes

1

answer

47

views

OR-weft Hierarchy

circuit-complexity parameterized-complexity circuit-families circuit-depth

modified 29 mins ago Bart Jansen 3,923

0

votes

0

answers

20

views

Optimal instances of transitive closure (in particular linear number of edges)?

ds.algorithms graph-theory graph-algorithms polynomial-time

modified 2 hours ago aaaaajack 1

0

votes

0

answers

14

views

Number theory and gauss sums in communication complexity

communication-complexity

asked 4 hours ago Turbo 3,135

7

votes

2

answers

48

views

What does a tangible Quantum-Gate look like?

physics quantum-computing

answered 12 hours ago Dendi Suhubdy 107

2

votes

1

answer

57

views

Why do timeouts require synchronized clocks?

dc.distributed-comp concurrency

modified 12 hours ago Community♦ 1

0

votes

1

answer

160

views

Is the value of $\max_{f:V\rightarrow [\frac{-1}{2},\frac{1}{2}], \\ \sum_{v}{f(v)}=0} \frac{f^T L_G f}{n-f^Tf}$ polynomially computable?

cc.complexity-theory polynomial-time spectral-graph-theory

modified 13 hours ago Community♦ 1

-3

votes

0

answers

32

views

Payment in non monetary auction mechanism

gt.game-theory mechanism-design

asked yesterday mehD 95

2

votes

1

answer

110

views

Why use two separate tables in cuckoo hashing?

ds.data-structures

answered yesterday jbapple 3,843

1

vote

1

answer

147

views

Math foundation for namespace problem

reference-request

answered yesterday heather 115

-2

votes

0

answers

31

views

Closest, bichromatic, non eucleadian point distance

computational-geometry

asked yesterday Michael K. 1

0

votes

0

answers

76

views

Is this graph communication game known?

cc.complexity-theory communication-complexity

modified yesterday András Salamon 12.7k

3

votes

0

answers

40

views

Algebraic decision trees and adversary arguments

lower-bounds decision-trees

asked yesterday Swaroop 38

-3

votes

0

answers

86

views

Why can't we determine the complexity of D-Wave's hardware?

cc.complexity-theory quantum-computing polynomial-time exp-time-algorithms

asked 2 days ago Alex Michael 1

current community

your communities

more stack exchange communities

Explore Our Questions

OR-weft Hierarchy

Optimal instances of transitive closure (in particular linear number of edges)?

Number theory and gauss sums in communication complexity

What does a tangible Quantum-Gate look like?

Why do timeouts require synchronized clocks?

Is the value of $\max_{f:V\rightarrow [\frac{-1}{2},\frac{1}{2}], \\ \sum_{v}{f(v)}=0} \frac{f^T L_G f}{n-f^Tf}$ polynomially computable?

Payment in non monetary auction mechanism

Why use two separate tables in cuckoo hashing?

Math foundation for namespace problem

Closest, bichromatic, non eucleadian point distance

Is this graph communication game known?

Algebraic decision trees and adversary arguments

Why can't we determine the complexity of D-Wave's hardware?

Visit Chat

Hot Network Questions