Network profile

Austin Buchanan

Reputation

1,616

2.2k
1.9k
1.6k

2018
2019
2020
2021

Top tag

cc.complexity-theory

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Revival

Next badge

0/1

Impact

4 posts edited

6 helpful flags

533 votes cast

13 Bookmarks

Votes Activity Newest Views Added

226

votes

answers

93k

views

Major unsolved problems in theoretical computer science?

big-list open-problem

Feb 10 '20 at 13:30 Community♦ 1

votes

answer

views

A combinatorial version for the polynomial Hirsch conjecture

co.combinatorics cg.comp-geom open-problem linear-programming

Jan 14 '14 at 20:47 Community♦ 1

votes

answers

views

Reference for NP-hardness of 3-colouring?

np-hardness ho.history-overview

Apr 29 '13 at 14:23 Yury 3,779

votes

answers

views

Kolmogorov's conjecture that $P$ has linear-size circuits

cc.complexity-theory reference-request circuit-complexity ho.history-overview

May 7 '14 at 3:01 GMB 2,043

votes

answers

views

Decide whether a matrix's kernel contains any non-zero vector all of whose entries are -1, 0, or 1

cc.complexity-theory np-hardness linear-algebra

Dec 26 '13 at 14:07 Community♦ 1

votes

answer

730

views

Is cubic complexity still the state of the art for LP?

cc.complexity-theory reference-request linear-programming

Aug 31 '14 at 15:06 jet 86

votes

answers

472

views

Linear-time algorithm to test if clique number equals degeneracy bound?

graph-algorithms parameterized-complexity clique fixed-parameter-tractable

Feb 12 at 4:14 Austin Buchanan 1,616

votes

answer

views

Equivalence of feasibility checking and optimization for linear systems

ds.algorithms linear-programming

Jan 29 '14 at 13:06 Kristoffer Arnsfelt Hansen 4,089

votes

answers

263

views

Checking whether two quadratic equations have a common zero

cc.complexity-theory algebraic-complexity quadratic

Apr 4 '16 at 14:44 Community♦ 1

votes

answers

views

Time complexity of a branching-and-bound algorithm

cc.complexity-theory ds.algorithms time-complexity

Dec 18 '14 at 0:19 Bangye 844

votes

answers

views

Trees: complexity of counting the number of vertex covers

cc.complexity-theory graph-theory counting-complexity

Jun 20 '20 at 14:02 Osman Ay 1

votes

answer

381

views

Complexity of “destroying” the graph's minimum spanning tree weight

cc.complexity-theory ds.algorithms graph-theory graph-algorithms tree

Jun 24 '16 at 1:02 mhum 3,314

votes

answer

160

views

Graph factors of maximum weight

ds.algorithms graph-theory graph-algorithms matching

Jul 25 '17 at 7:45 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

13 Bookmarks

Major unsolved problems in theoretical computer science?

A combinatorial version for the polynomial Hirsch conjecture

Reference for NP-hardness of 3-colouring?

Kolmogorov's conjecture that $P$ has linear-size circuits

Decide whether a matrix's kernel contains any non-zero vector all of whose entries are -1, 0, or 1

Is cubic complexity still the state of the art for LP?

Linear-time algorithm to test if clique number equals degeneracy bound?

Equivalence of feasibility checking and optimization for linear systems

Checking whether two quadratic equations have a common zero

Time complexity of a branching-and-bound algorithm

Trees: complexity of counting the number of vertex covers

Complexity of “destroying” the graph's minimum spanning tree weight

Graph factors of maximum weight