Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View history
Purge
English
Log in
No label defined
(Q3187177)
From MaRDI portal
Jump to:
navigation
,
search
scientific article
Language
Label
Description
Also known as
English
No label defined
scientific article
Statements
instance of
scholarly article
0 references
author
Raghav Kulkarni
0 references
Avishay Tal
0 references
published in
Chicago Journal of Theoretical Computer Science
0 references
publication date
16 August 2016
0 references
MaRDI profile type
MaRDI publication profile
0 references
full work available at URL
https://doi.org/10.4086/cjtcs.2016.008
0 references
cites work
A note on quantum black-box complexity of almost all Boolean functions
0 references
Polynomial degree vs. quantum query complexity
0 references
Complexity measures and decision tree complexity: a survey.
0 references
Q5414559
0 references
Block sensitivity of minterm-transitive functions
0 references
Composition limits and separating examples for some Boolean function complexity measures
0 references
Properties and applications of boolean function composition
0 references
Identifiers
zbMATH Open document ID
1365.68288
0 references
DOI
10.4086/cjtcs.2016.008
0 references
Mathematics Subject Classification ID
68Q25
0 references
68Q12
0 references
68W20
0 references
zbMATH DE Number
6617121
0 references
OpenAlex ID
W4230867312
0 references
Sitelinks
Mathematics
(1 entry)
mardi
Publication:3187177
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Concept URI
