Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with ..."

Hideaki Fukuhara, Eiji Takimoto (2009)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-08

- view
  - electronic edition @ westernsydney.edu.au (open access)
- export record
  dblp key:
  - conf/cats/FukuharaT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cats/FukuharaT09
Hideaki Fukuhara, Eiji Takimoto:
Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity Nodes. CATS 2009: 89-98

a service of

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.