HCM: Publications

Karpinski, Marek

Referenzen

121.	Farid Ablayev, Marek Karpinski und Rustam Mubarakzjanov On BPP versus {NPâ?ªcoNP} for ordered read-once branching programs Band 264 Seite 127--137. 2001 DOI: 10.1016/S0304-3975(00)00216-4
120.	Farid Ablayev, Aida Gainutdinova und Marek Karpinski On computational power of quantum branching programs Fundamentals of computation theory (Riga, 2001) Band 2138 aus Lecture Notes in Comput. Sci. Seite 59--70. Herausgeber: Springer, Berlin, 2001 DOI: 10.1007/3-540-44669-9_8
119.	Klaus Jansen, Marek Karpinski, Andrzej Lingas und Eike Seidel Polynomial time approximation schemes for Max-Bisection on planar and geometric graphs STACS 2001 (Dresden) Band 2010 aus Lecture Notes in Comput. Sci. Seite 365--375. Herausgeber: Springer, Berlin, 2001 DOI: 10.1007/3-540-44693-1_32
118.	M. Karpinski Polynomial time approximation schemes for some dense instances of NP-hard optimization problems Band 30 Seite 386--397. 2001 DOI: 10.1007/s00453-001-0012-z
117.	Piotr Berman, Moses Charikar und Marek Karpinski On-line load balancing for related machines J. Algorithms, 35(1):108--121 2000 DOI: 10.1006/jagm.1999.1070
116.	W. Fernandez de la Vega und M. Karpinski Polynomial time approximation of dense weighted instances of MAX-CUT Random Structures Algorithms, 16(4):314--332 2000 DOI: 10.1002/1098-2418(200007)16:4<314::AID-RSA2>3.0.CO;2-E
115.	Marek Karpinski, Alf van der Poorten und Igor Shparlinski Zero testing of p-adic and modular polynomials Theoret. Comput. Sci., 233(1-2):309--317 2000 DOI: 10.1016/S0304-3975(99)00133-4
114.	Marek Karpinski und Angus Macintyre Approximating volumes and integrals in o-minimal and p-minimal theories Connections between model theory and algebraic and analytic geometry Band 6 aus Quad. Mat. Seite 149--177. Herausgeber: Dept. Math., Seconda Univ. Napoli, Caserta, 2000
113.	Marek Karpinski und Angus Macintyre A generalization of Wilkie's theorem of the complement, and an application to Pfaffian closure Selecta Math. (N.S.), 5(4):507--516 1999 DOI: 10.1007/s000290050055
112.	Sergei Evdokimov, Marek Karpinski und Ilia Ponomarenko On a new high-dimensional Weisfeiler-Lehman algorithm J. Algebraic Combin., 10(1):29--45 1999 DOI: 10.1023/A:1018672019177
111.	W. Fernandez de la Vega und M. Karpinski On the approximation hardness of dense TSP and other path problems Inform. Process. Lett., 70(2):53--55 1999 DOI: 10.1016/S0020-0190(99)00048-4
110.	Sanjeev Arora, David Karger und Marek Karpinski Polynomial time approximation schemes for dense instances of NP-hard problems J. Comput. System Sci., 58(1):193--210 1999 DOI: 10.1006/jcss.1998.1605

Seite:

Previous | Publications, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next

Export als: