Polynomial - PDFSEARCH.IO - Document Search Engine

Polynomial
Results: 3445

#	Item
881	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics
882	CCCG 2011, Toronto ON, August 10–12, 2011 Enumerating Minimal Transversals of Geometric Hypergraphs Khaled Elbassioni∗ Imran Rauf† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:15 NP-complete problems Algorithm Set cover problem Polynomial Vertex cover Matroid Mathematics Hypergraph Applied mathematics
883	A Counterexample to Tensorability of Effects Sergey Goncharov and Lutz Schr¨ oder September 1, 2011 Add to Reading List Source URL: calco2011.ecs.soton.ac.uk Language: English - Date: 2011-09-15 16:48:46 Abstract algebra Monad Tensor Homogeneous polynomial Rank Strong monad Algebra Adjoint functors Mathematics
884	Counting points on curves in average polynomial time David Harvey and Andrew Sutherland February 24, 2014 Add to Reading List Source URL: math.mit.edu Language: English - Date: 2014-02-24 05:33:53 Mathematical analysis Algebraic curves Group theory Binary arithmetic Binary logarithm Calculus P Hyperelliptic curve Elliptic curve Mathematics Abstract algebra Logarithms
885	Limits and Applications of Group Algebras for Parameterized Problems∗ Ioannis Koutis Computer Science Department U. of Puerto Rico, Rio Piedras Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2013-03-05 13:51:43 Polynomials Homogeneous polynomials Monomial XTR Polynomial FO Elementary symmetric polynomial Polynomial ring Mathematics Algebra Abstract algebra
886	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
887	Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of TechnologyOh-Okayama, Meguro-ku, TokyoJapan Add to Reading List Source URL: www.is.titech.ac.jp Language: English - Date: 2003-01-09 20:35:42 Abstract algebra Algebraic topology Homotopy System of polynomial equations CW complex Linear programming Polynomial Homotopy principle Topology Mathematics Homotopy theory
888	Precalculus Prerequisites a.k.a. ‘Chapter 0’ by Carl Stitz, Ph.D. Lakeland Community College Add to Reading List Source URL: www.stitz-zeager.com Language: English - Date: 2013-08-16 15:33:04 Equations Elementary algebra Analytic functions Inverse functions Trigonometric functions Precalculus Generalized trigonometry Polynomial Complex number Mathematics Algebra Trigonometry
889 $Analytic geometry / Elementary algebra / Rational function / Tangent / Polynomial / Trigonometric functions / Derivative / Logarithm / Continued fraction / Mathematics / Mathematical analysis / Analytic functions$	Analysis with Uniform Error Bounds Hermann Karcher, Version OctTranslated by Ursula Weiss and Michael Livshits 2011 This text has been used twice in Bonn for first semester courses in Analysis: Mathematik I Winter Add to Reading List Source URL: www.math.uni-bonn.de Language: English - Date: 2012-02-21 12:24:01 Analytic geometry Elementary algebra Rational function Tangent Polynomial Trigonometric functions Derivative Logarithm Continued fraction Mathematics Mathematical analysis Analytic functions
890	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Privacy by Fake Data: A Geometric Approach Victor Alvarez∗ Erin Chambers† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Complexity classes Structural complexity theory Mathematical optimization Approximation algorithms Ε-net NP Polynomial-time approximation scheme Reduction Packing problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE