Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Thomas Hofmeister
@article{DBLP:journals/dcg/BernholtEH09, author = {Thorsten Bernholt and Friedrich Eisenbrand and Thomas Hofmeister}, title = {Constrained Minkowski Sums: {A} Geometric Framework for Solving Interval Problems in Computational Biology Efficiently}, journal = {Discret. Comput. Geom.}, volume = {42}, number = {1}, pages = {22--36}, year = {2009}, url = {https://doi.org/10.1007/s00454-009-9178-y}, doi = {10.1007/S00454-009-9178-Y}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/BernholtEH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/HofmeisterSSW07, author = {Thomas Hofmeister and Uwe Sch{\"{o}}ning and Rainer Schuler and Osamu Watanabe}, title = {Randomized Algorithms for 3-SAT}, journal = {Theory Comput. Syst.}, volume = {40}, number = {3}, pages = {249--262}, year = {2007}, url = {https://doi.org/10.1007/s00224-005-1275-6}, doi = {10.1007/S00224-005-1275-6}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/HofmeisterSSW07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/BernholtEH07, author = {Thorsten Bernholt and Friedrich Eisenbrand and Thomas Hofmeister}, editor = {Jeff Erickson}, title = {A geometric framework for solving subsequence problems in computational biology efficiently}, booktitle = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007}, pages = {310--318}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1247069.1247125}, doi = {10.1145/1247069.1247125}, timestamp = {Mon, 14 Jun 2021 16:25:02 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/BernholtEH07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/BernholtH06, author = {Thorsten Bernholt and Thomas Hofmeister}, editor = {Jos{\'{e}} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, title = {An Algorithm for a Generalized Maximum Subsequence Problem}, booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3887}, pages = {178--189}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11682462\_20}, doi = {10.1007/11682462\_20}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/BernholtH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/Hofmeister03, author = {Thomas Hofmeister}, editor = {Giuseppe Di Battista and Uri Zwick}, title = {An Approximation Algorithm for {MAX-2-SAT} with Cardinality Constraint}, booktitle = {Algorithms - {ESA} 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2832}, pages = {301--312}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39658-1\_29}, doi = {10.1007/978-3-540-39658-1\_29}, timestamp = {Sun, 02 Jun 2019 21:14:37 +0200}, biburl = {https://dblp.org/rec/conf/esa/Hofmeister03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/insk/BernholtGHSW02, author = {Thorsten Bernholt and Alexander G{\"{u}}lich and Thomas Hofmeister and Niels Schmitt and Ingo Wegener}, title = {Komplexit{\"{a}}tstheorie, effiziente Algorithmen und die Bundesliga}, journal = {Inform. Spektrum}, volume = {25}, number = {6}, pages = {488--502}, year = {2002}, url = {https://doi.org/10.1007/s002870200261}, doi = {10.1007/S002870200261}, timestamp = {Thu, 13 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/insk/BernholtGHSW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HofmeisterSSW02, author = {Thomas Hofmeister and Uwe Sch{\"{o}}ning and Rainer Schuler and Osamu Watanabe}, editor = {Helmut Alt and Afonso Ferreira}, title = {A Probabilistic 3-SAT Algorithm Further Improved}, booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2285}, pages = {192--202}, publisher = {Springer}, year = {2002}, url = {https://doi.org/10.1007/3-540-45841-7\_15}, doi = {10.1007/3-540-45841-7\_15}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/HofmeisterSSW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Bertram-KretzbergHL00, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister and Hanno Lefmann}, title = {An Algorithm for Heilbronn's Problem}, journal = {{SIAM} J. Comput.}, volume = {30}, number = {2}, pages = {383--390}, year = {2000}, url = {https://doi.org/10.1137/S0097539798348870}, doi = {10.1137/S0097539798348870}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Bertram-KretzbergHL00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/HofmeisterKS00, author = {Thomas Hofmeister and Matthias Krause and Hans Ulrich Simon}, title = {Contrast-optimal k out of n secret sharing schemes in visual cryptography}, journal = {Theor. Comput. Sci.}, volume = {240}, number = {2}, pages = {471--485}, year = {2000}, url = {https://doi.org/10.1016/S0304-3975(99)00243-1}, doi = {10.1016/S0304-3975(99)00243-1}, timestamp = {Fri, 08 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/HofmeisterKS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Bertram-KretzbergHL99, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister and Hanno Lefmann}, title = {Sparse 0-1-Matrices And Forbidden Hypergraphs}, journal = {Comb. Probab. Comput.}, volume = {8}, number = {5}, pages = {417--427}, year = {1999}, url = {http://journals.cambridge.org/action/displayAbstract?aid=46751}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Bertram-KretzbergHL99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/eurocolt/Hofmeister99, author = {Thomas Hofmeister}, editor = {Paul Fischer and Hans Ulrich Simon}, title = {An Application of Codes to Attribute-Efficient Learning}, booktitle = {Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1572}, pages = {101--110}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-49097-3\_9}, doi = {10.1007/3-540-49097-3\_9}, timestamp = {Fri, 08 Sep 2023 21:18:19 +0200}, biburl = {https://dblp.org/rec/conf/eurocolt/Hofmeister99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BernholtGHS99, author = {Thorsten Bernholt and Alexander G{\"{u}}lich and Thomas Hofmeister and Niels Schmitt}, editor = {Miroslaw Kutylowski and Leszek Pacholski and Tomasz Wierzbicki}, title = {Football Elimination Is Hard to Decide Under the 3-Point-Rule}, booktitle = {Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1672}, pages = {410--418}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-48340-3\_37}, doi = {10.1007/3-540-48340-3\_37}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BernholtGHS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/HofmeisterL98, author = {Thomas Hofmeister and Hanno Lefmann}, title = {On k-Partite Subgraphs}, journal = {Ars Comb.}, volume = {50}, year = {1998}, timestamp = {Fri, 09 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/HofmeisterL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/HofmeisterL98, author = {Thomas Hofmeister and Hanno Lefmann}, editor = {Lubos Brim and Jozef Gruska and Jir{\'{\i}} Zlatuska}, title = {Approximating Maximum Independent Sets in Uniform Hypergraphs}, booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1450}, pages = {562--570}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0055806}, doi = {10.1007/BFB0055806}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/HofmeisterL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Bertram-KretzbergHL98, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister and Hanno Lefmann}, editor = {Howard J. Karloff}, title = {Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract)}, booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, {USA}}, pages = {181--187}, publisher = {{ACM/SIAM}}, year = {1998}, url = {http://dl.acm.org/citation.cfm?id=314613.314698}, timestamp = {Thu, 05 Jul 2018 07:29:49 +0200}, biburl = {https://dblp.org/rec/conf/soda/Bertram-KretzbergHL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/Bertram-KretzbergHL97, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister and Hanno Lefmann}, editor = {Tao Jiang and D. T. Lee}, title = {An Algorithm for Heilbronn's Problem}, booktitle = {Computing and Combinatorics, Third Annual International Conference, {COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1276}, pages = {23--31}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0045069}, doi = {10.1007/BFB0045069}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/Bertram-KretzbergHL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/HofmeisterKS97, author = {Thomas Hofmeister and Matthias Krause and Hans Ulrich Simon}, editor = {Tao Jiang and D. T. Lee}, title = {Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography}, booktitle = {Computing and Combinatorics, Third Annual International Conference, {COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1276}, pages = {176--185}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0045084}, doi = {10.1007/BFB0045084}, timestamp = {Fri, 08 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/HofmeisterKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/HofmeisterH97, author = {Thomas Hofmeister and Martin H{\"{u}}hne}, editor = {Ernst W. Mayr and Hans J{\"{u}}rgen Pr{\"{o}}mel and Angelika Steger}, title = {Semidefinite Programming and Its Applications to Approximation Algorithms}, booktitle = {Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997)}, series = {Lecture Notes in Computer Science}, volume = {1367}, pages = {263--298}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0053021}, doi = {10.1007/BFB0053021}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/HofmeisterH97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Bertram-KretzbergH96, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister}, title = {Multiple Product Modulo Arbitrary Numbers}, journal = {Inf. Comput.}, volume = {131}, number = {1}, pages = {81--93}, year = {1996}, url = {https://doi.org/10.1006/inco.1996.0093}, doi = {10.1006/INCO.1996.0093}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Bertram-KretzbergH96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HofmeisterL96, author = {Thomas Hofmeister and Hanno Lefmann}, title = {Independent Sets in Graphs with Triangles}, journal = {Inf. Process. Lett.}, volume = {58}, number = {5}, pages = {207--210}, year = {1996}, url = {https://doi.org/10.1016/0020-0190(96)00072-5}, doi = {10.1016/0020-0190(96)00072-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HofmeisterL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/HofmeisterL96, author = {Thomas Hofmeister and Hanno Lefmann}, title = {A combinatorial design approach to {MAXCUT}}, journal = {Random Struct. Algorithms}, volume = {9}, number = {1-2}, pages = {163--175}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2\&\#60;163::AID-RSA10\&\#62;3.0.CO;2-P}, doi = {10.1002/(SICI)1098-2418(199608/09)9:1/2\&\#60;163::AID-RSA10\&\#62;3.0.CO;2-P}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/HofmeisterL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/Hofmeister96, author = {Thomas Hofmeister}, editor = {Jin{-}yi Cai and C. K. Wong}, title = {A Note on the Simulation of Exponential Threshold Weights}, booktitle = {Computing and Combinatorics, Second Annual International Conference, {COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1090}, pages = {136--141}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61332-3\_146}, doi = {10.1007/3-540-61332-3\_146}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/Hofmeister96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HofmeisterL96, author = {Thomas Hofmeister and Hanno Lefmann}, editor = {Claude Puech and R{\"{u}}diger Reischuk}, title = {A Combinatorial Design Approach to {MAXCUT}}, booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1046}, pages = {441--452}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-60922-9\_36}, doi = {10.1007/3-540-60922-9\_36}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/HofmeisterL96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/HofmeisterL95, author = {Thomas Hofmeister and Hanno Lefmann}, editor = {Jir{\'{\i}} Wiedermann and Petr H{\'{a}}jek}, title = {Derandomization for Sparse Approximations and Independent Sets}, booktitle = {Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {969}, pages = {201--210}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60246-1\_126}, doi = {10.1007/3-540-60246-1\_126}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/HofmeisterL95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/Bertram-KretzbergH95, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister}, editor = {Jir{\'{\i}} Wiedermann and Petr H{\'{a}}jek}, title = {Multiple Product Modulo Arbitrary Numbers}, booktitle = {Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {969}, pages = {288--298}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60246-1\_135}, doi = {10.1007/3-540-60246-1\_135}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/Bertram-KretzbergH95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR95-017, author = {Claudia Bertram{-}Kretzberg and Thomas Hofmeister}, title = {Multiple Product Modulo Arbitrary Numbers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR95-017}}, year = {1995}, url = {https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-017/index.html}, eprinttype = {ECCC}, eprint = {TR95-017}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR95-017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Hofmeister93, author = {Thomas Hofmeister}, title = {Thresholdschaltkreise kleiner Tiefe}, school = {Technical University of Dortmund, Germany}, year = {1993}, url = {https://d-nb.info/932017339}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Hofmeister93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/SiuBKH93, author = {Kai{-}Yeung Siu and Jehoshua Bruck and Thomas Kailath and Thomas Hofmeister}, title = {Depth efficient neural networks for division and related problems}, journal = {{IEEE} Trans. Inf. Theory}, volume = {39}, number = {3}, pages = {946--956}, year = {1993}, url = {https://doi.org/10.1109/18.256501}, doi = {10.1109/18.256501}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/SiuBKH93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Hofmeister92, author = {Thomas Hofmeister}, title = {The Power of Negative Thinking in Constructing Threshold Circuits for Addition}, booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, June 22-25, 1992}, pages = {20--26}, publisher = {{IEEE} Computer Society}, year = {1992}, url = {https://doi.org/10.1109/SCT.1992.215377}, doi = {10.1109/SCT.1992.215377}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Hofmeister92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HofmeisterHK91, author = {Thomas Hofmeister and Walter Hohberg and Susanne K{\"{o}}hling}, title = {Some Notes on Threshold Circuits, and Multiplication in Depth 4}, journal = {Inf. Process. Lett.}, volume = {39}, number = {4}, pages = {219--225}, year = {1991}, url = {https://doi.org/10.1016/0020-0190(91)90183-I}, doi = {10.1016/0020-0190(91)90183-I}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HofmeisterHK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/HofmeisterHK91, author = {Thomas Hofmeister and Walter Hohberg and Susanne K{\"{o}}hling}, editor = {Lothar Budach}, title = {Some Notes on Threshold Circuits, and Multiplication in Depth 4}, booktitle = {Fundamentals of Computation Theory, 8th International Symposium, {FCT} '91, Gosen, Germany, September 9-13, 1991, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {529}, pages = {230--239}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-54458-5\_67}, doi = {10.1007/3-540-54458-5\_67}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/HofmeisterHK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.