{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:03Z","timestamp":1750308663760,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T00:00:00Z","timestamp":1292457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2010,12,16]]},"DOI":"10.1145\/1907450.1907532","type":"journal-article","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T15:55:04Z","timestamp":1292860504000},"page":"58-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Questions answered. in theory."],"prefix":"10.1145","volume":"41","author":[{"given":"Dave","family":"Clarke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaveh","family":"Ghasemloo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lev","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Salamon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Shor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Sterling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,12,16]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Scott Aaronson. Are there canonical non-relativizing techniques ? http:\/\/cstheory.stackexchange.com\/q\/2048\/  Scott Aaronson. Are there canonical non-relativizing techniques ? http:\/\/cstheory.stackexchange.com\/q\/2048\/"},{"key":"e_1_2_1_2_1","unstructured":"Jeff Atwood and Joel Spolsky. Stackexchange. http:\/\/www.stackexchange.com  Jeff Atwood and Joel Spolsky. Stackexchange. http:\/\/www.stackexchange.com"},{"key":"e_1_2_1_3_1","unstructured":"CSTheory Stackexchange Community. Automata Theory \/ Formal Languages (MS) Thesis topic. http:\/\/cstheory.stackexchange.com\/q\/979\/  CSTheory Stackexchange Community. Automata Theory \/ Formal Languages (MS) Thesis topic. http:\/\/cstheory.stackexchange.com\/q\/979\/"},{"key":"e_1_2_1_4_1","unstructured":"CSTheory Stackexchange Community. How do I referee a paper ? http:\/\/cstheory.stackexchange.com\/q\/1893\/  CSTheory Stackexchange Community. How do I referee a paper ? http:\/\/cstheory.stackexchange.com\/q\/1893\/"},{"key":"e_1_2_1_5_1","unstructured":"CSTheory Stackexchange Community. How to get a job. http:\/\/cstheory.stackexchange.com\/q\/2215\/  CSTheory Stackexchange Community. How to get a job. http:\/\/cstheory.stackexchange.com\/q\/2215\/"},{"key":"e_1_2_1_6_1","unstructured":"CSTheory Stackexchange Community. Inspirational talk for final year high school pupils. http:\/\/cstheory.stackexchange.com\/q\/2386\/  CSTheory Stackexchange Community. Inspirational talk for final year high school pupils. http:\/\/cstheory.stackexchange.com\/q\/2386\/"},{"key":"e_1_2_1_7_1","unstructured":"CSTheory Stackexchange Community. Interactive proofs for levels of the polynomial hierarchy. http:\/\/cstheory.stackexchange.com\/q\/2461\/  CSTheory Stackexchange Community. Interactive proofs for levels of the polynomial hierarchy. http:\/\/cstheory.stackexchange.com\/q\/2461\/"},{"key":"e_1_2_1_8_1","unstructured":"CSTheory Stackexchange Community. What's new in purely functional data structures since Okasaki. http:\/\/cstheory.stackexchange.com\/q\/1539\/  CSTheory Stackexchange Community. What's new in purely functional data structures since Okasaki. http:\/\/cstheory.stackexchange.com\/q\/1539\/"},{"key":"e_1_2_1_9_1","unstructured":"Jeff Erickson. The reasons for BSS (real-RAM) model being preferred in Computational Geometry. http:\/\/cstheory.stackexchange.com\/q\/2124\/  Jeff Erickson. The reasons for BSS (real-RAM) model being preferred in Computational Geometry. http:\/\/cstheory.stackexchange.com\/q\/2124\/"},{"key":"e_1_2_1_10_1","unstructured":"Sariel Har-Peled. Hamiltonicity of k-regular graphs. http:\/\/cstheory.stackexchange.com\/q\/1656\/  Sariel Har-Peled. Hamiltonicity of k-regular graphs. http:\/\/cstheory.stackexchange.com\/q\/1656\/"},{"key":"e_1_2_1_11_1","unstructured":"Russell Impagliazzo. Why do complexity classes translate upwards and not downwards? http:\/\/cstheory.stackexchange.com\/q\/2453\/  Russell Impagliazzo. Why do complexity classes translate upwards and not downwards? http:\/\/cstheory.stackexchange.com\/q\/2453\/"},{"key":"e_1_2_1_12_1","unstructured":"Shiva Kintali and Derrick Stolee. When should you say what you know? http:\/\/cstheory.stackexchange.com\/q\/2362\/  Shiva Kintali and Derrick Stolee. When should you say what you know? http:\/\/cstheory.stackexchange.com\/q\/2362\/"},{"key":"e_1_2_1_13_1","unstructured":"Robin Kothari. Problems that can be used to show polynomial time hardness results. http:\/\/cstheory.stackexchange.com\/q\/1284\/  Robin Kothari. Problems that can be used to show polynomial time hardness results. http:\/\/cstheory.stackexchange.com\/q\/1284\/"},{"key":"e_1_2_1_14_1","unstructured":"Michael Nielsen. Deolalikar's P vs NP paper. http:\/\/michaelnielsen.org\/polymath1\/index.php?title=Deolalikar%27s_P!%3DNP_paper  Michael Nielsen. Deolalikar's P vs NP paper. http:\/\/michaelnielsen.org\/polymath1\/index.php?title=Deolalikar%27s_P!%3DNP_paper"},{"key":"e_1_2_1_15_1","unstructured":"Noam Nisan. Does Nisan's pseudo-random generator relativize? http:\/\/cstheory.stackexchange.com\/q\/2239\/  Noam Nisan. Does Nisan's pseudo-random generator relativize? http:\/\/cstheory.stackexchange.com\/q\/2239\/"},{"key":"e_1_2_1_16_1","unstructured":"Joseph O'Rourke. Truly random number generator: Turing computable? http:\/\/cstheory.stackexchange.com\/q\/1263\/  Joseph O'Rourke. Truly random number generator: Turing computable? http:\/\/cstheory.stackexchange.com\/q\/1263\/"},{"key":"e_1_2_1_17_1","unstructured":"Peter Shor. MAX CUT with negative edge weights. http:\/\/cstheory.stackexchange.com\/q\/2318\/  Peter Shor. MAX CUT with negative edge weights. http:\/\/cstheory.stackexchange.com\/q\/2318\/"},{"key":"e_1_2_1_18_1","unstructured":"Jukka Suomela. Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete? http:\/\/cstheory.stackexchange.com\/q\/2508\/  Jukka Suomela. Is the dominating set problem restricted to planar bipartite graphs of maximum degree 3 NP-complete? http:\/\/cstheory.stackexchange.com\/q\/2508\/"},{"key":"e_1_2_1_19_1","unstructured":"User ged. Complexity of greatest common divisor (gcd). http:\/\/cstheory.stackexchange.com\/q\/2708\/  User ged. Complexity of greatest common divisor (gcd). http:\/\/cstheory.stackexchange.com\/q\/2708\/"},{"key":"e_1_2_1_20_1","unstructured":"Per Vognsen. Alternative proofs of Schwartz-Zippel lemma. http:\/\/cstheory.stackexchange.com\/q\/1883\/  Per Vognsen. Alternative proofs of Schwartz-Zippel lemma. http:\/\/cstheory.stackexchange.com\/q\/1883\/"},{"key":"e_1_2_1_21_1","unstructured":"Ryan Williams. Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively the Axiom of Determinacy?). http:\/\/cstheory.stackexchange.com\/q\/1923\/  Ryan Williams. Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively the Axiom of Determinacy?). http:\/\/cstheory.stackexchange.com\/q\/1923\/"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1907450.1907532","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1907450.1907532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:00:27Z","timestamp":1750276827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1907450.1907532"}},"subtitle":["http:\/\/cstheory.stackexchange.com\/"],"short-title":[],"issued":{"date-parts":[[2010,12,16]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12,16]]}},"alternative-id":["10.1145\/1907450.1907532"],"URL":"https:\/\/doi.org\/10.1145\/1907450.1907532","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2010,12,16]]},"assertion":[{"value":"2010-12-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}