1![Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un Sharp Bounds on Davenport-Schinzel Sequences of Every Order SETH PETTIE, University of Michigan One of the longest-standing open problems in computational geometry is bounding the complexity of the lower envelope of n un](https://www.pdfsearch.io/img/7a88d2f595a98f29a17b63d6ba4c03dd.jpg) | Add to Reading ListSource URL: web.eecs.umich.eduLanguage: English |
---|
2![Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexity Milan Hlad´ık ˇ y Michal Cern´ Optimization of Quadratic Forms and t-norm Forms on Interval Domain and Computational Complexity Milan Hlad´ık ˇ y Michal Cern´](https://www.pdfsearch.io/img/22af2f060593e5e4685a936eee6ae0e4.jpg) | Add to Reading ListSource URL: www.cs.utep.eduLanguage: English - Date: 2018-02-17 12:27:45
|
---|
3![On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is](https://www.pdfsearch.io/img/ae7ebed67e752e7fea65df88b3e9c591.jpg) | Add to Reading ListSource URL: www.mathematik.uni-leipzig.deLanguage: English - Date: 2013-11-18 06:32:25
|
---|
4![Linguist and Philos:215–250 DOIs10988z RESEARCH ARTICLE Computational complexity of polyadic lifts of generalized quantifiers in natural language Linguist and Philos:215–250 DOIs10988z RESEARCH ARTICLE Computational complexity of polyadic lifts of generalized quantifiers in natural language](https://www.pdfsearch.io/img/029b0bd351011374acd2c2b667f1362f.jpg) | Add to Reading ListSource URL: jakubszymanik.comLanguage: English - Date: 2011-11-28 07:51:42
|
---|
5![Appeared in SIAM Journal on Computing 27(4):, August
Computational Complexity and Knowledge Appeared in SIAM Journal on Computing 27(4):, August
Computational Complexity and Knowledge](https://www.pdfsearch.io/img/37e01686f0a66231a550e74881581a16.jpg) | Add to Reading ListSource URL: web.cs.ucla.eduLanguage: English - Date: 2003-09-23 18:57:54
|
---|
6![Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25 Notes on Computational Complexity Theory CPSC: Spring 2017 James Aspnes:25](https://www.pdfsearch.io/img/c5f49c90c2110fa0dbdb7bc8d0fb3445.jpg) | Add to Reading ListSource URL: cs.yale.eduLanguage: English - Date: 2018-02-16 14:25:41
|
---|
7![Extensive Form Correlated Equilibrium: Definition and Computational Complexity Bernhard von Stengel Department of Mathematics, London School of Economics, Houghton St, London WC2A 2AE, United Kingdom email: stengel@maths Extensive Form Correlated Equilibrium: Definition and Computational Complexity Bernhard von Stengel Department of Mathematics, London School of Economics, Houghton St, London WC2A 2AE, United Kingdom email: stengel@maths](https://www.pdfsearch.io/img/f946671d98ebe7e337d675f36b23a2c7.jpg) | Add to Reading ListSource URL: www.cdam.lse.ac.ukLanguage: English - Date: 2017-04-12 10:30:40
|
---|
8![On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th On the notion of bit complexity Claus Diem August 21, 2010 Abstract In many works in the fields of computational complexity, algorithmic number theory and mathematical cryptology as well as in related areas, claims on th](https://www.pdfsearch.io/img/0d248772c146ddf092a81a344222cb3d.jpg) | Add to Reading ListSource URL: www.mathematik.uni-leipzig.deLanguage: English - Date: 2010-08-21 13:57:07
|
---|
9![Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat Madhu Sudan Gordon McKay Professor, John A. Paulson School of Engineering and Applied Sciences, Harvard University Areas of Special Interests Theory of Computing, Algorithms, Computational Complexity, Reliable Communicat](https://www.pdfsearch.io/img/cfe97ce5ffd989c743907d5339d74cb6.jpg) | Add to Reading ListSource URL: madhu.seas.harvard.eduLanguage: English - Date: 2015-09-22 20:56:09
|
---|
10![1 1 Computational Complexity of Graphs Stasys Jukna1 1 1 Computational Complexity of Graphs Stasys Jukna1](https://www.pdfsearch.io/img/a40807f04852e01ce2bc3c5aeb8fc5c2.jpg) | Add to Reading ListSource URL: lovelace.thi.informatik.uni-frankfurt.deLanguage: English - Date: 2015-10-27 15:13:47
|
---|