On the P versus NP intersected with co-NP question in communication complexity
type: Item
instance of: scholarly article
title: On the P versus NP intersected with co-NP question in communication complexity
zbMATH Open document ID: 1184.68265
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 5650156
zbMATH Keywords: computational complexity
zbMATH Keywords: communication complexity
author: Stasys Jukna
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.08.003
OpenAlex ID: W2032941175
cites work: On multi-partition communication complexity
cites work: Information Transfer under Different Sets of Protocols
cites work: Q4792910
cites work: On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
cites work: The Probabilistic Communication Complexity of Set Intersection
cites work: Communication Complexity
cites work: Results on communication complexity classes
cites work: Q4385521
cites work: CREW PRAM<scp>s</scp> and Decision Trees
cites work: Communication complexity
cites work: On the distributional complexity of disjointness
cites work: Q4418659
cites work: Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
cites work: Branching Programs and Binary Decision Diagrams
DOI: 10.1016/J.IPL.2005.08.003
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: Q3002823
Recommended article: On the complexity of communication complexity
Recommended article: Q5111142
Recommended article: Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\)
Recommended article: Q4988302
Recommended article: Q4882998
Recommended article: Communication Complexity and Lower Bounds on Multilective Computations
Recommended article: On a communication complexity problem in combinatorial number theory
Recommended article: On the complexity of interactive proofs with bounded communication
description: scientific article; zbMATH DE number 5650156