Skip to main content
Computer Science
hola's user avatar
hola's user avatar
hola's user avatar
hola
  • Member for 10 years, 4 months
  • Last seen more than 1 year ago
Profile Activity

45 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
awarded
 Notable Question
awarded
 Custodian
reviewed
Approve
SAT and #SAT in Quantum
comment
SAT and #SAT in Quantum
If I understand correctly, the answer depends on the specific problem. If the problem has many solutions, then the quantum advantage diminishes.
comment
SAT and #SAT in Quantum
Is there any specific name to this algorithm?
revised
SAT and #SAT in Quantum
corrected
awarded
 Curious
revised
SAT and #SAT in Quantum
edited question
comment
Quantum Supremacy Task
"On a very simple level, quantum computers are essentially random number generators.", I like that phrasing.
asked
SAT and #SAT in Quantum
comment
Is MAX-SAT NP-hard?
I don't know, but here it says, MAX-SAT is NP-complete.
comment
Is MAX-SAT NP-hard?
Somehow I feel that wikipedia article is not correct.
awarded
 Promoter
revised
Fermat's last theorem: How to (partially) solve by programs
fixed links, proper math text
suggested
Approve
Fermat's last theorem: How to (partially) solve by programs
revised
Fermat's last theorem: How to (partially) solve by programs
$
comment
How to solve T(n) = T(n-1) + n^2?
Suggested to use Tex formatting for mathematical formulae.
comment
How to solve F(n)=F(n-1)+F(n-2)+f(n) recursive function?
Suggested to use Tex formatting for mathematical formulae.
asked
Fermat's last theorem: How to (partially) solve by programs
awarded
 Yearling
1
2 3