meta user
network profile
| bio | website | |
|---|---|---|
| location | Seattle, WA | |
| age | ||
| visits | member for | 1 year, 5 months |
| seen | 1 hour ago | |
| stats | profile views | 29 |
I am a computer programmer. Knowledge representation and algorithmic complexity are my main interests.
|
9h |
awarded | Constituent |
|
9h |
awarded | Caucus |
|
Apr 30 |
comment |
Is Integer Linear Programming a special case of Linear Programming Linear equations as examples would be cleaner. |
|
Apr 11 |
awarded | Organizer |
|
Apr 11 |
revised |
Colouring a chessboard added coloring tag because this is a graph coloring problem |
|
Apr 11 |
suggested | suggested edit on Colouring a chessboard |
|
Apr 11 |
comment |
Colouring a chessboard A lot of work has already been done on grid colorings; see Rectangle Free Coloring of Grids by Fenner, Gasarch, Glover and Purewal. There's an old chart available showing what is known about grids and their possible colorings. There was a small prize offered a few years ago for a 4-coloring of the 17x17 grid (claimed in 2012)]. |
|
Apr 9 |
answered | transform traveling salesman problem into subgraph isomorphism problem |
|
Mar 17 |
awarded | Commentator |
|
Mar 17 |
comment |
Matrix Partioning with number of rows being optimized. Your question would be improved with an example or two, as it is not obvious to me how the matrix to be produced would ever have less than twice the number of rows of the original matrix. So the minimum possible number of rows requirement makes no sense, unless I'm misunderstanding the question. |
|
Dec 17 |
awarded | Yearling |
|
Dec 10 |
awarded | Revival |
|
May 27 |
awarded | Fanatic |
|
Apr 2 |
comment |
Is the card game war np-complete Questions about whether a problem is inherently sequential are usually questions about P-completeness, not NP-completeness. Take some P-complete problem like HORNSAT or CIRCUIT-VALUE and see if you can map all instances of it to a game of War. If you can, then the general problem of determining the victor in War is equivalent to solving a P-complete problem and is thus probably not solvable any faster than just playing the game out to conclusion. |
|
Mar 8 |
comment |
Connect 4 - SAT TQBF = QSAT. |
|
Mar 3 |
awarded | Citizen Patrol |
|
Jan 30 |
awarded | Quorum |
|
Jan 29 |
awarded | Critic |
|
Jan 15 |
awarded | Enthusiast |
|
Jan 13 |
answered | Why do mathematicians use single-letter variables? |
