Amanote Research

Amanote Research

    RegisterSign In

Towards a Reverse Newman's Theorem in Interactive Information Complexity

doi 10.1109/ccc.2013.12
Full Text
Open PDF
Abstract

Available in full text

Date

June 1, 2013

Authors
Joshua BrodyHarry BuhrmanMichal KouckyBruno LoffFlorian SpeelmanNikolay Vereshchagin
Publisher

IEEE


Related search

Managing Complexity: Towards Intelligent Error-Handling Assistance Trough Interactive Alarm Flood Reduction

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

The Complexity of Satisfaction Problems in Reverse Mathematics

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2015English

Towards a Theory of Phonological Complexity

Linguistics in the Netherlands
LinguisticsPsychologyLanguageHealth ProfessionsMultidisciplinarySocial Sciences
1991English

The Complexity of Theorem-Proving Procedures

1971English

Towards Interactive QI Workflows

2016English

Towards Handling Latency in Interactive Software

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Student Use of an Interactive Theorem Prover

Contemporary Mathematics
Mathematics
1984English

Towards Interactive Object-Oriented Programming

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2015English

Complexity and Information

Choice Reviews Online
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy