Matches in SemOpenAlex for { <https://semopenalex.org/work/W2013173685> ?p ?o ?g. }
Showing items 1 to 50 of
50
with 100 items per page.
- W2013173685 endingPage "96" @default.
- W2013173685 startingPage "91" @default.
- W2013173685 abstract "Branching program depth and the logarithm of branching program complexity are lower bounds on time and space requirements for any reasonable model of sequential computation. In order to gain more insight to the complexity of branching programs and to the problems of time-space trade-offs one considers, on one hand, width-restricted and, on the other hand, depth-restricted branching programs. We present these computation models and the trade-off results already proved. We prove a new result of this type by presenting an effectively defined Boolean function whose complexity in depth-restricted one-time-only branching programs is exponential while its complexity even in width-2 branching programs is polynomial." @default.
- W2013173685 created "2016-06-24" @default.
- W2013173685 creator A5075262791 @default.
- W2013173685 date "1986-02-01" @default.
- W2013173685 modified "2023-09-27" @default.
- W2013173685 title "Time-space trade-offs for branching programs" @default.
- W2013173685 cites W2000356135 @default.
- W2013173685 cites W2097859771 @default.
- W2013173685 doi "https://doi.org/10.1016/0022-0000(86)90004-8" @default.
- W2013173685 hasPublicationYear "1986" @default.
- W2013173685 type Work @default.
- W2013173685 sameAs 2013173685 @default.
- W2013173685 citedByCount "12" @default.
- W2013173685 countsByYear W20131736852022 @default.
- W2013173685 crossrefType "journal-article" @default.
- W2013173685 hasAuthorship W2013173685A5075262791 @default.
- W2013173685 hasBestOaLocation W20131736851 @default.
- W2013173685 hasConcept C111919701 @default.
- W2013173685 hasConcept C159985019 @default.
- W2013173685 hasConcept C192562407 @default.
- W2013173685 hasConcept C206175624 @default.
- W2013173685 hasConcept C2778572836 @default.
- W2013173685 hasConcept C41008148 @default.
- W2013173685 hasConceptScore W2013173685C111919701 @default.
- W2013173685 hasConceptScore W2013173685C159985019 @default.
- W2013173685 hasConceptScore W2013173685C192562407 @default.
- W2013173685 hasConceptScore W2013173685C206175624 @default.
- W2013173685 hasConceptScore W2013173685C2778572836 @default.
- W2013173685 hasConceptScore W2013173685C41008148 @default.
- W2013173685 hasIssue "1" @default.
- W2013173685 hasLocation W20131736851 @default.
- W2013173685 hasOpenAccess W2013173685 @default.
- W2013173685 hasPrimaryLocation W20131736851 @default.
- W2013173685 hasRelatedWork W1974919125 @default.
- W2013173685 hasRelatedWork W2014836299 @default.
- W2013173685 hasRelatedWork W2034871982 @default.
- W2013173685 hasRelatedWork W2036711164 @default.
- W2013173685 hasRelatedWork W2148974013 @default.
- W2013173685 hasRelatedWork W2358668433 @default.
- W2013173685 hasRelatedWork W2390279801 @default.
- W2013173685 hasRelatedWork W2748952813 @default.
- W2013173685 hasRelatedWork W2899084033 @default.
- W2013173685 hasRelatedWork W2462424100 @default.
- W2013173685 hasVolume "32" @default.
- W2013173685 isParatext "false" @default.
- W2013173685 isRetracted "false" @default.
- W2013173685 magId "2013173685" @default.
- W2013173685 workType "article" @default.