Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
159 | Levke Bentzien |
Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 474-482, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
98 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing polynomial identity tests means proving circuit lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 355-364, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
BPP, NEXP, circuit lower bounds, derandomization, polynomial identity testing |
94 | Stephen A. Fenner, Lance Fortnow |
Beyond P^(NP) - NEXP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995, Proceedings, pp. 619-627, 1995, Springer, 3-540-59042-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
65 | Harry Buhrman, Lance Fortnow, Aduri Pavan |
Some Results on Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 212-222, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
61 | Dror Lapidot, Adi Shamir |
Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 13-18, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
one-round perfect zero-knowledge protocol, fully parallelized multi prover protocols, NEXP-time, language, parallel executions |
49 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 13(1-2), pp. 1-46, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
68Q17, 68Q15, Subject classification. 68Q10 |
49 | Hirotada Kobayashi, Keiji Matsumoto |
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 115-127, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
49 | Russell Impagliazzo, Valentine Kabanets, Avi Wigderson |
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 2-12, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 741-748, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
33 | Scott Aaronson, Avi Wigderson |
Algebrization: a new barrier in complexity theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 731-740, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
communication complexity, oracles, arithmetization, interactive proofs, query complexity, low-degree polynomials |
33 | Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xiaoming Sun 0001, Andrew Chi-Chih Yao |
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 187-198, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multi-prover interactive proof systems, quantum nonlocality, Tsirelson inequality, entanglement |
33 | Eric Allender, Michal Koucký 0001, Detlef Ronneburger, Sambuddha Roy |
Derandomization and Distinguishing Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 209-220, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Tommi Syrjänen |
Omega-Restricted Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 6th International Conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, Proceedings, pp. 267-279, 2001, Springer, 3-540-42593-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Kousha Etessami, Moshe Y. Vardi, Thomas Wilke |
First-Order Logic with Two Variables and Unary Temporal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 228-235, 1997, IEEE Computer Society, 0-8186-7925-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
33 | Harry Buhrman, Leen Torenvliet |
On the Cutting Edge of Relativization: The Resource Bounded Injury Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 263-273, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Scott Aaronson, Sabee Grewal, Vishnu Iyer, Simon C. Marshall, Ronak Ramachandran |
PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.02543, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
29 | Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan |
Reducing NEXP-complete problems to DQBF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.06014, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Fa-Hsun Chen, Shen-Chang Huang, Yu-Cheng Lu, Tony Tan |
Reducing NEXP-complete problems to DQBF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: 22nd Formal Methods in Computer-Aided Design, FMCAD 2022, Trento, Italy, October 17-21, 2022, pp. 199-204, 2022, IEEE, 978-3-85448-053-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Anant Dhayal |
On Limiting & Limited Non-determinism in NEXP Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
29 | Xiaojun Meng, Pin Sym Foong, Simon T. Perrault, Shengdong Zhao |
NexP: A Beginner Friendly Toolkit for Designing and Conducting Controlled Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INTERACT (3) ![In: Human-Computer Interaction - INTERACT 2017 - 16th IFIP TC 13 International Conference, Mumbai, India, September 25-29, 2017, Proceedings, Part III, pp. 132-141, 2017, Springer, 978-3-319-67686-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
29 | Antonis Achilleos |
NEXP-completeness and Universal Hardness Results for Justification Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.00362, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
29 | Kazuyuki Amano, Atsushi Saito |
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, pp. 461-472, 2015, Springer, 978-3-319-15578-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
29 | Antonis Achilleos |
NEXP-Completeness and Universal Hardness Results for Justification Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, pp. 27-52, 2015, Springer, 978-3-319-20296-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
29 | Dung T. Nguyen, Alan L. Selman |
Non-autoreducible Sets for NEXP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France, pp. 590-601, 2014, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-65-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
29 | Egor Ianovski, Luke Ong |
EGuaranteeNash for Boolean Games Is NEXP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014, 2014, AAAI Press, 978-1-57735-657-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
29 | Bin Fu |
Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial Circuit Lower Bounds for NEXP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
29 | Dung T. Nguyen, Alan L. Selman |
Non-autoreducible Sets for NEXP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
29 | Egor Ianovski, Luke Ong |
EGuaranteeNash for Boolean Games is NEXP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.4114, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
29 | Bin Fu |
Derandomizing Polynomial Identity over Finite Fields Implies Super-Polynomial Circuit Lower Bounds for NEXP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.2358, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
29 | Ryan Williams 0001 |
Towards NEXP versus BPP? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings, pp. 174-182, 2013, Springer, 978-3-642-38535-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
29 | Shlomi Dolev, Nova Fandina, Dan Gutfreund |
Succinct Permanent Is NEXP-Hard with Many Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings, pp. 183-196, 2013, Springer, 978-3-642-38232-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
29 | Shlomi Dolev, Nova Fandina, Dan Gutfreund |
Succinct Permanent is NEXP-hard with Many Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
29 | Tsuyoshi Ito, Thomas Vidick |
A multi-prover interactive proof for NEXP sound against entangled provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
29 | Tsuyoshi Ito, Thomas Vidick |
A multi-prover interactive proof for NEXP sound against entangled provers ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1207.0550, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
29 | Tsuyoshi Ito, Thomas Vidick |
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pp. 243-252, 2012, IEEE Computer Society, 978-1-4673-4383-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
29 | Fengming Wang |
NEXP does not have non-uniform quasi-polynomial-size ACC circuits of o(loglog n) depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
29 | Fengming Wang |
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 8th Annual Conference, TAMC 2011, Tokyo, Japan, May 23-25, 2011. Proceedings, pp. 164-170, 2011, Springer, 978-3-642-20876-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
29 | Carsten Lutz |
NEXP TIME-complete description logics with concrete domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 5(4), pp. 669-705, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
NExpTime-completeness, concrete domains, domino problem, Computational complexity, description logic, post correspondence problem |
29 | Piotr Faliszewski |
Exponential time reductions and sparse languages in NEXP ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR04, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
29 | Dror Lapidot, Adi Shamir |
Fully Parallelized Multi-Prover Protocols for NEXP-Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 54(2), pp. 215-220, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Baris Eker, H. Levent Akin |
Using evolution strategies to solve DEC-POMDP problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 14(1), pp. 35-47, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
DEC-POMDP, Multi-robot decision making, Evolution control, Evolution strategies |
16 | Harry Buhrman, Lance Fortnow, Rahul Santhanam |
Unconditional Lower Bounds against Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 195-209, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
An axiomatic approach to algebrization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 695-704, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
algebrization, independence, relativization |
16 | Christopher Amato, Shlomo Zilberstein |
Achieving goals in decentralized POMDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS (1) ![In: 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), Budapest, Hungary, May 10-15, 2009, Volume 1, pp. 593-600, 2009, IFAAMAS, 978-0-9817381-6-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Thomas Eiter, Giovambattista Ianni, Thomas Krennwallner, Roman Schindlauer |
Exploiting conjunctive queries in description logic programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 53(1-4), pp. 115-152, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68T27, 68T35, 68T30 |
16 | David G. Mitchell, Eugenia Ternovska |
Expressive power and abstraction in Essence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 13(3), pp. 343-384, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Essence, Constraint modelling languages, Model expansion, Abstraction, Expressive power, Descriptive complexity |
16 | Michael Ben-Or, Avinatan Hassidim, Haran Pilpel |
Quantum Multi Prover Interactive Proofs with Communicating Provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 467-476, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor |
The Power of Unentanglement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 223-236, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
QMA, 3SAT, PCP Theorem, quantum computing, additivity, entanglement |
16 | Yang Xiang 0004, Franklin Hanshar |
Planning in Multiagent Expedition with Collaborative Design Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Canadian AI ![In: Advances in Artificial Intelligence, 20th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2007, Montreal, Canada, May 28-30, 2007, Proceedings, pp. 526-538, 2007, Springer, 978-3-540-72664-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr |
Equivalence Problems for Circuits over Sets of Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 127-138, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Julien Lafaye |
On the Complexity of Obtaining Optimal Watermarking Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWDW ![In: Digital Watermarking, 6th International Workshop, IWDW 2007, Guangzhou, China, December 3-5, 2007, Proceedings, pp. 395-409, 2007, Springer, 978-3-540-92237-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
Verifying and decoding in constant depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 440-449, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
error-correcting codes, interactive proofs, constant-depth circuits |
16 | Stefan Göller |
On the Complexity of Reasoning About Dynamic Policies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 358-373, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Philipp Weis, Neil Immerman |
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 343-357, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Kiran Lakkaraju, Les Gasser |
The Complexity of Finding an Optimal Policy for Language Convergence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAB ![In: From Animals to Animats 9, 9th International Conference on Simulation of Adaptive Behavior, SAB 2006, Rome, Italy, September 25-29, 2006, Proceedings, pp. 804-815, 2006, Springer, 3-540-38608-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Russell Impagliazzo |
Can every randomized algorithm be derandomized? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 373-374, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
algebraic circuit complexity, probabilistic algorithms, derandomization, circuit complexity, complexity classes, pseudo-randomness |
16 | Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran |
Some Results on Average-Case Hardness Within the Polynomial Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings, pp. 188-199, 2006, Springer, 3-540-49994-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Matthijs T. J. Spaan, Geoffrey J. Gordon, Nikos Vlassis |
Decentralized planning under uncertainty for teams of communicating agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 249-256, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
decentralized POMDPs, artificial intelligence, planning under uncertainty, cooperative multiagent systems |
16 | Jianhui Wu 0006, Edmund H. Durfee |
Mixed-integer linear programming for transition-independent decentralized MDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 1058-1060, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
transition-independent decentralized MDP, mixed integer linear programming, MDP, piecewise linear approximation |
16 | Jiaying Shen, Raphen Becker, Victor R. Lesser |
Agent interaction in distributed POMDPs and its implications on complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 529-536, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
distributed POMDP, interaction, complexity |
16 | Konstantinos Daskalakis, Christos H. Papadimitriou |
The Complexity of Games on Highly Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 71-82, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Gus Gutoski |
Upper Bounds for Quantum Interactive Proofs with Competing Provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 334-343, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Eli Ben-Sasson, Oded Goldreich 0001, Prahladh Harsha, Madhu Sudan 0001, Salil P. Vadhan |
Short PCPs Verifiable in Polylogarithmic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 120-134, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Aurélie Beynier, Abdel-Illah Mouaddib |
A polynomial algorithm for decentralized Markov decision processes with temporal constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The Netherlands, pp. 963-969, 2005, ACM, 1-59593-094-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
multi-agent systems, uncertainty, planning, Markov decision processes |
16 | Eric Allender, Harry Buhrman, Michal Koucký 0001 |
What Can be Efficiently Reduced to the K-Random Strings? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 584-595, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Ranjit Nair, Milind Tambe |
Coordinating Teams in Uncertain Environments: A Hybrid BDI-POMDP Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PROMAS ![In: Programming Multi-Agent Systems, Second International Workshop ProMAS 2004, New York, NY, USA, July 20, 2004 Selected Revised and Invited Papers, pp. 1-37, 2004, Springer, 3-540-24559-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Ranjit Nair, Milind Tambe, Maayan Roth, Makoto Yokoo |
Communication for Improving Policy Computation in Distributed POMDPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 19-23 August 2004, New York, NY, USA, pp. 1098-1105, 2004, IEEE Computer Society, 1-58113-864-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Raphen Becker, Shlomo Zilberstein, Victor R. Lesser, Claudia V. Goldman |
Transition-independent decentralized markov decision processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: The Second International Joint Conference on Autonomous Agents & Multiagent Systems, AAMAS 2003, July 14-18, 2003, Melbourne, Victoria, Australia, Proceedings, pp. 41-48, 2003, ACM, 1-58113-683-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
decentralized MDP, decision-theoretic planning |
16 | Iadine Chades, Bruno Scherrer, François Charpillet |
A heuristic approach for solving decentralized-POMDP: assessment on the pursuit problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), March 10-14, 2002, Madrid, Spain, pp. 57-62, 2002, ACM, 1-58113-445-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
decision theoretic agents, multiagent systems |
16 | Ranjit Nair, Milind Tambe, Stacy Marsella |
Team Formation for Reformation in Multiagent Domains Like RoboCupRescue. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RoboCup ![In: RoboCup 2002: Robot Soccer World Cup VI, pp. 150-161, 2002, Springer, 3-540-40666-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Marcus Schaefer 0001, Eric Sedgwick, Daniel Stefankovic |
Recognizing string graphs in NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 1-6, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Harry Buhrman, Lance Fortnow |
Resource-Bounded Kolmogorov Complexity Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings, pp. 105-116, 1997, Springer, 3-540-62616-6. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Stephen A. Fenner, Lance Fortnow, Lide Li |
Gap-Definability as a Closure Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 484-493, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Harry Buhrman, Albrecht Hoene, Leen Torenvliet |
Splittings, Robustness and Structure of Complete Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings, pp. 175-184, 1993, Springer, 3-540-56503-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan |
Algebraic Methods for Interactive Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(4), pp. 859-868, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
interactive proof systems |
16 | K. Ganesan 0001 |
One-way Functions and Isomorphism Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 12th Conference, New Delhi, India, December 18-20, 1992, Proceedings, pp. 152-163, 1992, Springer, 3-540-56287-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Donald Beaver, Joan Feigenbaum, Victor Shoup |
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO ![In: Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings, pp. 326-338, 1990, Springer, 3-540-54508-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|