Matches in SemOpenAlex for { <https://semopenalex.org/work/W2064751579> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2064751579 endingPage "498" @default.
- W2064751579 startingPage "471" @default.
- W2064751579 abstract "We consider the intrinsic complexity of selected algorithmic problems of classical elimination theory in algebraic geometry. The inputs and outputs of these problems are given by finite sets of polynomials which we represent alternatively in dense form or by straight line programs. We begin with an overview on the known upper bounds for the sequential and parallel time complexity of these problems and show then that in the most important cases these bounds are tight. Our lower bound results include both the relative and the absolute viewpoint of complexity theory. On one side we give reductions of fundamental questions of elimination theory to NP- and P#-complete problems and on the other side we show that some of these questions may have exponential size outputs. In this way we confirm the intrinsically exponential character of algorithmic problems in elimination theory whatever the type of data structure may be." @default.
- W2064751579 created "2016-06-24" @default.
- W2064751579 creator A5009389655 @default.
- W2064751579 creator A5048972918 @default.
- W2064751579 date "1993-12-01" @default.
- W2064751579 modified "2023-09-30" @default.
- W2064751579 title "On the Intrinsic Complexity of Elimination Theory" @default.
- W2064751579 doi "https://doi.org/10.1006/jcom.1993.1031" @default.
- W2064751579 hasPublicationYear "1993" @default.
- W2064751579 type Work @default.
- W2064751579 sameAs 2064751579 @default.
- W2064751579 citedByCount "58" @default.
- W2064751579 countsByYear W20647515792012 @default.
- W2064751579 countsByYear W20647515792013 @default.
- W2064751579 countsByYear W20647515792018 @default.
- W2064751579 countsByYear W20647515792019 @default.
- W2064751579 crossrefType "journal-article" @default.
- W2064751579 hasAuthorship W2064751579A5009389655 @default.
- W2064751579 hasAuthorship W2064751579A5048972918 @default.
- W2064751579 hasBestOaLocation W20647515791 @default.
- W2064751579 hasConcept C11413529 @default.
- W2064751579 hasConcept C118615104 @default.
- W2064751579 hasConcept C134306372 @default.
- W2064751579 hasConcept C151376022 @default.
- W2064751579 hasConcept C179799912 @default.
- W2064751579 hasConcept C33923547 @default.
- W2064751579 hasConcept C77553402 @default.
- W2064751579 hasConcept C9376300 @default.
- W2064751579 hasConceptScore W2064751579C11413529 @default.
- W2064751579 hasConceptScore W2064751579C118615104 @default.
- W2064751579 hasConceptScore W2064751579C134306372 @default.
- W2064751579 hasConceptScore W2064751579C151376022 @default.
- W2064751579 hasConceptScore W2064751579C179799912 @default.
- W2064751579 hasConceptScore W2064751579C33923547 @default.
- W2064751579 hasConceptScore W2064751579C77553402 @default.
- W2064751579 hasConceptScore W2064751579C9376300 @default.
- W2064751579 hasIssue "4" @default.
- W2064751579 hasLocation W20647515791 @default.
- W2064751579 hasLocation W20647515792 @default.
- W2064751579 hasLocation W20647515793 @default.
- W2064751579 hasOpenAccess W2064751579 @default.
- W2064751579 hasPrimaryLocation W20647515791 @default.
- W2064751579 hasRelatedWork W1987758573 @default.
- W2064751579 hasRelatedWork W2016607282 @default.
- W2064751579 hasRelatedWork W2083193613 @default.
- W2064751579 hasRelatedWork W2288625294 @default.
- W2064751579 hasRelatedWork W2920704135 @default.
- W2064751579 hasRelatedWork W2963370966 @default.
- W2064751579 hasRelatedWork W3020808117 @default.
- W2064751579 hasRelatedWork W4297912182 @default.
- W2064751579 hasRelatedWork W4362496593 @default.
- W2064751579 hasRelatedWork W2963783964 @default.
- W2064751579 hasVolume "9" @default.
- W2064751579 isParatext "false" @default.
- W2064751579 isRetracted "false" @default.
- W2064751579 magId "2064751579" @default.
- W2064751579 workType "article" @default.