Søgning Billeder Maps Play YouTube Gmail Drev Kalender Mere »
Log ind
Bøger Bøger 1 - 7 af 7 om S. BASU, R. POLLACK, M.-F. ROY, On the Combinatorial and Algebraic Complexity of....
" S. BASU, R. POLLACK, M.-F. ROY, On the Combinatorial and Algebraic Complexity of Quantifier Elimination, Journal of the ACM , 43 1002-1045, (1996). "
Algorithms in Real Algebraic Geometry - Side 587
af Saugata Basu, Richard Pollack, Marie-Françoise Roy, Marie-Françoise Coste-Roy - 2003 - 602 sider
Begrænset visning - Om denne bog

Formal Power Series and Algebraic Combinatorics: 12th International ...

Daniel Krob - 2000 - 808 sider
...tree width (tutorial). Theoretical Computer Science, 208:1-45, 1998. [BPR96] S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43(6):1002-1045, 1996. [Biir99] P. Biirgisser. Completeness and reduction in algebraic complexity theory....
Begrænset visning - Om denne bog

Foundations of Computational Mathematics: Proceedings of the Smalefest 2000 ...

Felipe Cucker, Joseph Maurice Rojas - 2002 - 480 sider
...bounded tree-width (tutorial), Theoretical Computer Science 208, 1-45 (1998). 9. S. Basu, R. Pollack, and M.-F. Roy, On the combinatorial and algebraic complexity of quantifier elimination, Journal of the ACM 43(6), 10021045 (1996). 10. L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity...
Begrænset visning - Om denne bog

Algorithmic and Quantitative Real Algebraic Geometry: DIMACS Workshop ...

Saugata Basu, Laureano González-Vega - 2003 - 219 sider
...35th IEEE Symp. on Foundations of Computer Science (1994). 632-641. [BPR96] S. Basu, R. Pollack, and MF Roy, On the combinatorial and algebraic complexity of quantifier elimination. Journal of Assoc. Comput. Machin. (1996). 1002-1045. [CA76] G. Collins and A. Akritas. Polynomial real root isolation...
Begrænset visning - Om denne bog

Alan Turing: Life and Legacy of a Great Thinker

Christof Teuscher - 2004 - 542 sider
...Automated Reasoning, voL IL pp. 1151-1238. Elsevier Science (2001). 8. Basu, S., Pollack. R., and Roy. MF, On the Combinatorial and Algebraic Complexity of Quantifier Elimination, Journal of the ACM 43(6):1002-1046, 1996. 9. Beeson, M., Some applications of Gentzen's proof theory to automated deduction,...
Begrænset visning - Om denne bog

Research Problems in Discrete Geometry

Peter Brass, William O. J. Moser, János Pach - 2006 - 500 sider
...over real closed fields and applications to constraint databases, J. ACM 46 (1999) 537-555. [BaPR96] S. BASU, R. POLLACK, M.-F. ROY: On the combinatorial...and algebraic complexity of quantifier elimination, J. ACM 43 (1996) 1002-1046. [BeB85] A. BEZDEK, K. BEZDEK: Uber einige diinnste Kreisiiberdeckungen...
Begrænset visning - Om denne bog

Handbooks in Operations Research and Management Science: Discrete Optimization

K. Aardal, George L. Nemhauser, R. Weismantel - 2005 - 620 sider
...constraints. Discrete and Computational Geometry 25, 23-31. Basu, S., R. Pollack, M.-F. Roy (1996). On the combinatorial and algebraic complexity of quantifier elimination. Journal of the Association for Computing Machinery 43, 1002-1045. Bellare, M., P. Rogaway (1995). The complexity of...
Begrænset visning - Om denne bog

Foundations of Software Science and Computational Structures: 10th ...

Helmut Seidl - 2007 - 379 sider
...processes. Journal of Computer and System Sciences, 60(1):187-231, 2000. 2. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43(6):1002-1045, 1996. 3. F. van Breugel. A behavioural pseudometric for metric labelled transition...
Begrænset visning - Om denne bog




  1. Min samling
  2. Hjælp
  3. Avanceret bogsøgning