bio | website | cs.toronto.edu/~kaveh |
---|---|---|
location | Toronto, Canada | |
age | ||
visits | member for | 3 years, 9 months |
seen | yesterday | |
stats | profile views | 1,427 |
Ph.D. student at University of Toronto, Department of Computer Science, Theory Group.
Old moderator on cstheory.
Apr 4 |
awarded | Nice Question |
Mar 17 |
comment |
What is a sieve and why are sieves useful?
@Tom, thanks, I fixed it. |
Mar 17 |
revised |
What is a sieve and why are sieves useful?
deleted 3 characters in body |
Mar 17 |
comment |
What is a sieve and why are sieves useful?
Thanks @Andres, the preface and the first chapters of the book look promising. |
Mar 17 |
revised |
What is a sieve and why are sieves useful?
added 17 characters in body |
Mar 17 |
asked | What is a sieve and why are sieves useful? |
Feb 19 |
awarded | Popular Question |
Jan 5 |
awarded | Custodian |
Jan 5 |
reviewed | Approve suggested edit on Can I express any odd number with a power of two minus a prime? |
Dec 31 |
comment |
Can We Decide Whether Small Computer Programs Halt?
What do you exactly mean by "constructive"? |
Dec 31 |
comment |
Can We Decide Whether Small Computer Programs Halt?
From the comments above I feel there might be a confusion about what is a "constructive algorithm", I don't really know what the OP means by putting "constructive" in front of "algorithm", I guess a typical interpretation would be the code of the algorithm for $Halt_n$ is uniformly computable from $n$. But then the OP goes on to say that "for some $n$" that contradicts that interpretation. |
Dec 30 |
comment |
Reference Request for Integer factorization with LP/ILP
And since IP is NP-complete it is also an easy exercise to formulate any NP problem as IP. However the algorithms for IP are exponential time in the worst case and people have tried to various formulations of factoring as IP and studied them. You can try Google to find them. Another thing you can try: try to use your reduction to IP and CPLEX to break RSA factoring challenges. |
Dec 30 |
comment |
Reference Request for Integer factorization with LP/ILP
It is easy to formulate any NP problem as an LP (an undergrad exercise), however if the solutions are not restricted to integral solutions it will not solve the original problem but a relaxation of it. The result will not mean anything if you cannot round the solution of LP to a meaningful integral one. |
Oct 25 |
awarded | Good Question |
Oct 16 |
revised |
Is there a notion of Skolemization for continuous logic?
added 1 characters in body |
Oct 16 |
answered | Is there a notion of Skolemization for continuous logic? |
Oct 16 |
comment |
Why worry about the axiom of choice?
The two statements are very close to each other so it might worth to explore why we have mentally different intuitions about the two statements. I think it might have to do with the word "choice" as if we need some action performed by an agent while for the other one there is no such word. |
Oct 16 |
comment |
The origins of forcing in mathematical logic and other branches of mathematics
Also Friedberg-Muchnik Theorem |
Oct 13 |
comment |
Quantum PCP Theorem
Copy on cstheory |
Oct 8 |
awarded | Constituent |