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
comment
When to use SAT vs Constraint Satisfaction?
I had the same question, thanks for asking.
awarded
 Commentator
awarded
 Teacher
accepted
Converting truth table to algebraic normal form
revised
Converting truth table to algebraic normal form
link to answer
answered
Converting truth table to algebraic normal form
revised
Converting truth table to algebraic normal form
link to answer
comment
Traveling Salesman -- number of qubits required?
In case @user you got a grasp, consider sharing your experience (by a blog/video/report)...
awarded
 Citizen Patrol
comment
How to "logically" solve boolean logic
Welcome to cs.stackexchange. Your question sounds more like a homework. Anyway, you can start looking at the truth-tables -- this may give you a hint.
asked
Finding infeasible sets of constraints (CSP)
awarded
 Popular Question
accepted
King of the North: Placing bannermen surrounding castle
asked
King of the North: Placing bannermen surrounding castle
awarded
 Scholar
accepted
Why are states called locations in Timed Automata?
comment
Why are states called locations in Timed Automata?
@reinierpost Thank you for giving the original paper. Basically, I was reading it from some study materials from the web, e.g., fi.muni.cz/~xpelanek/IA158/TA-intro.pdf, lsv.ens-cachan.fr/Publis/PAPERS/PDF/BL-litron08.pdf
revised
Why are states called locations in Timed Automata?
inserted wiki links
asked
Why are states called locations in Timed Automata?
awarded
 Editor