default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Scheiblechner
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2008
[b1]Peter Scheiblechner:
Complexity of Counting Components of Algebraic Varieties - Irreducible and Connected Components, Betti Numbers. VDM 2008, ISBN 978-3-8364-9844-9, pp. I-VI, 1-146
Journal Articles
- 2022
- [j7]Marcin Bilski, Peter Scheiblechner:
Effective approximation of the solutions of algebraic equations. J. Symb. Comput. 109: 144-176 (2022) - 2021
- [j6]Jana Koehler
, Josef Bürgler, Urs Fontana, Etienne Fux, Florian A. Herzog, Marc Pouly, Sophia Saller, Anastasia Salyaeva, Peter Scheiblechner, Kai Waelti:
Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints. Constraints An Int. J. 26(1): 56-106 (2021) - 2012
- [j5]Peter Scheiblechner:
Castelnuovo-Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties. Found. Comput. Math. 12(5): 541-571 (2012) - 2010
- [j4]Peter Bürgisser, Peter Scheiblechner:
Counting Irreducible Components of Complex Algebraic Varieties. Comput. Complex. 19(1): 1-35 (2010) - [j3]Peter Scheiblechner:
On a generalization of Stickelberger's Theorem. J. Symb. Comput. 45(12): 1459-1470 (2010) - 2009
- [j2]Peter Bürgisser, Peter Scheiblechner:
On the complexity of counting components of algebraic varieties. J. Symb. Comput. 44(9): 1114-1136 (2009) - 2007
- [j1]Peter Scheiblechner:
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety. J. Complex. 23(3): 359-379 (2007)
Conference and Workshop Papers
- 2012
- [c3]Peter Scheiblechner:
Effective de Rham cohomology: the hypersurface case. ISSAC 2012: 305-310 - 2010
- [c2]Peter Scheiblechner:
On Lower Bounds for Algebraic Decision Trees over the Complex Numbers. SYNASC 2010: 362-365 - 2007
- [c1]Peter Bürgisser, Peter Scheiblechner:
Differential forms in computational algebraic geometry. ISSAC 2007: 61-68
Informal and Other Publications
- 2020
- [i6]Jana Koehler, Josef Bürgler, Urs Fontana, Etienne Fux, Florian A. Herzog, Marc Pouly, Sophia Saller, Anastasia Salyaeva, Peter Scheiblechner, Kai Waelti:
Cable Tree Wiring - Benchmarking Solvers on a Real-World Scheduling Problem with a Variety of Precedence Constraints. CoRR abs/2011.12862 (2020) - 2012
- [i5]Johannes Mittmann, Nitin Saxena, Peter Scheiblechner:
Algebraic Independence in Positive Characteristic -- A p-Adic Calculus. CoRR abs/1202.4301 (2012) - [i4]Peter Scheiblechner:
Effective de Rham Cohomology - The General Case. CoRR abs/1203.5706 (2012) - [i3]Johannes Mittmann, Nitin Saxena, Peter Scheiblechner:
Algebraic Independence in Positive Characteristic - A p-Adic Calculus. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i2]Peter Scheiblechner:
Effective de Rham Cohomology - The Hypersurface Case. CoRR abs/1112.2489 (2011) - 2009
- [i1]Peter Scheiblechner:
Castelnuovo-Mumford Regularity and Computing the de Rham Cohomology of Smooth Projective Varieties. CoRR abs/0905.2212 (2009)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
