Keisuke Tanaka

IACR Cryptol. ePrint Arch., 2023

1-out-of-n Oblivious Signatures: Security Revisited and a Generic Construction with an Efficient Communication Cost.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2023, 2023

2022

Obfustopia Built on Secret-Key Functional Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2022

CCA Security and Trapdoor Functions via Key-Dependent-Message Security.

[BibT_eX]

[DOI]

Takahiro Matsuda

J. Cryptol., 2022

Receiver Selective Opening Chosen Ciphertext Secure Identity-Based Encryption.

[BibT_eX]

[DOI]

Takahiro Matsuda

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022

Bid-Matching Problem and Score-Based Consensus for Peer-to-Peer Energy Trading.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Generic transformation from broadcast encryption to round-optimal deniable ring authentication.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

Environmental Adaptive Privacy Preserving Contact Tracing System: A Construction From Public Key Rerandomizable BLS Signatures.

[BibT_eX]

[DOI]

IEEE Access, 2022

How to Prove Work: With Time or Memory.

[BibT_eX]

[DOI]

Xiangyu Su

IEEE Access, 2022

Multikey Verifiable Homomorphic Encryption.

[BibT_eX]

[DOI]

Yi Lu

IEEE Access, 2022

Pointcheval-Sanders Signature-Based Synchronized Aggregate Signature.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2022, 2022

Analysis of (U, U+V)-code Problem with Gramian over Binary and Ternary Fields.

[BibT_eX]

[DOI]

Ichiro Iwata

Proceedings of the Information Security and Cryptology - ICISC 2022, 2022

Efficient Two-Party Exponentiation from Quotient Transfer.

[BibT_eX]

[DOI]

Proceedings of the Applied Cryptography and Network Security, 2022

2021

Tightly secure ring signatures in the standard model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Simple and Generic Constructions of Succinct Functional Encryption.

[BibT_eX]

[DOI]

J. Cryptol., 2021

Fine-Grained Cryptography Revisited.

[BibT_eX]

[DOI]

Shohei Egashira

J. Cryptol., 2021

Redactable Signature with Compactness from Set-Commitment.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Watermarkable Signature with Computational Function Preserving.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Receiver Selective Opening CCA Secure Public Key Encryption from Various Assumptions.

[BibT_eX]

[DOI]

Yi Lu

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Fully Anonymous Group Signature with Verifier-Local Revocation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Interhead Hydra Two Heads are Better than One.

[BibT_eX]

[DOI]

Maxim Jourenko

IACR Cryptol. ePrint Arch., 2021

Turn-Based Communication Channels.

[BibT_eX]

[DOI]

Carlo Brunetta

Bei Liang

Aikaterini Mitrokotsa

IACR Cryptol. ePrint Arch., 2021

Evaluation of handwriting task difficulty based on detrended fluctuation analysis.

[BibT_eX]

[DOI]

Masafumi Uchida

Artif. Life Robotics, 2021

Ring Signature With Unconditional Anonymity in the Plain Model.

[BibT_eX]

[DOI]

IEEE Access, 2021

Forward Secure Message Franking.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2021, 2021

Environmental Adaptive Privacy Preserving Contact Tracing System for Respiratory Infectious Diseases.

[BibT_eX]

[DOI]

Proceedings of the Cyberspace Safety and Security - 13th International Symposium, 2021

2020

Non-Committing Encryption with Constant Ciphertext Expansion from Standard Assumptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Payment Trees: Low Collateral Payments for Payment Channel Networks.

[BibT_eX]

[DOI]

Maxim Jourenko

IACR Cryptol. ePrint Arch., 2020

Lightweight Virtual Payment Channels.

[BibT_eX]

[DOI]

Maxim Jourenko

IACR Cryptol. ePrint Arch., 2020

Evaluation of task difficulty based on fluctuation characteristics in writing task.

[BibT_eX]

[DOI]

Ken Arai

Masafumi Uchida

Artif. Life Robotics, 2020

Secret Sharing with Statistical Privacy and Computational Relaxed Non-malleability.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2020, 2020

Security Definitions on Time-Lock Puzzles.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2020, 2020

Improved Security Proof for the Camenisch-Lysyanskaya Signature-Based Synchronized Aggregate Signature Scheme.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 25th Australasian Conference, 2020

2019

Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Non-Committing Encryption with Quasi-Optimal Ciphertext-Rate Based on the DDH Problem.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Simple and Efficient KDM-CCA Secure Public Key Encryption.

[BibT_eX]

[DOI]

Takahiro Matsuda

IACR Cryptol. ePrint Arch., 2019

SoK: A Taxonomy for Layer-2 Scalability Related Protocols for Cryptocurrencies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Proper Usage of the Group Signature Scheme in ISO/IEC 20008-2.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

A t-out-of-n Redactable Signature Scheme.

[BibT_eX]

[DOI]

Xiangyu Su

Proceedings of the Cryptology and Network Security - 18th International Conference, 2019

2018

Performance analysis of robust watermarking using linear and nonlinear feature matching.

[BibT_eX]

[DOI]

Multim. Tools Appl., 2018

Generic Constructions for Fully Secure Revocable Attribute-Based Encryption.

[BibT_eX]

[DOI]

Kotoko Yamada

Nuttapong Attrapadung

Keita Emura

Goichiro Hanaoka

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Impossibility on Tamper-Resilient Cryptography with Uniqueness Properties.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Memory Lower Bounds of Reductions Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

A Framework for Achieving KDM-CCA Secure Public-Key Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Weakened Random Oracle Models with Target Prefix.

[BibT_eX]

[DOI]

Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2018

Fully Anonymous Group Signature with Verifier-Local Revocation.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

2017

An image zero-watermarking algorithm based on the encryption of visual map feature with watermark information.

[BibT_eX]

[DOI]

Multim. Tools Appl., 2017

Generic Transformation for Signatures in the Continual Leakage Model.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Group Signature with Deniability: How to Disavow a Signature.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Anonymous Single-Round Server-Aided Verification.

[BibT_eX]

[DOI]

Elena Pagnin

Aikaterini Mitrokotsa

IACR Cryptol. ePrint Arch., 2017

Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

From Single-Key to Collusion-Resistant Secret-Key Functional Encryption by Leveraging Succinctness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Indistinguishability Obfuscation for All Circuits from Secret-Key Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Indistinguishability Obfuscation: Simpler Constructions using Secret-Key Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction.

[BibT_eX]

[DOI]

Comput. J., 2017

CCA2 Key-Privacy for Code-Based Encryption in the Standard Model.

[BibT_eX]

[DOI]

Kirill Morozov

Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

Constructions for the IND-CCA1 Secure Fully Homomorphic Encryption.

[BibT_eX]

[DOI]

Satoshi Yasuda

Proceedings of the Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project, 2017

How to Strengthen the Security of Signature Schemes in the Leakage Models: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Modelling for Next-Generation Cryptography: CREST Crypto-Math Project, 2017

2016

Generic transformations for existentially unforgeable signature schemes in the bounded leakage model.

[BibT_eX]

[DOI]

Secur. Commun. Networks, 2016

The novel and robust watermarking method based on q-logarithm frequency domain.

[BibT_eX]

[DOI]

Multim. Tools Appl., 2016

Strongly simulation-extractable leakage-resilient NIZK.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2016

Foreword.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Game-Theoretic Security for Two-Party Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Signatures Resilient to Uninvertible Leakage.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016

Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes.

[BibT_eX]

[DOI]

Hirotoshi Takebe

Proceedings of the Advances in Information and Computer Security, 2016

2015

Disavowable Public Key Encryption with Non-Interactive Opening.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Post-Challenge Leakage Resilient Public-Key Cryptosystem in Split State Model.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Blind Watermarking using QIM and the Quantized SVD Domain based on the <i>q-</i>Logarithm Function.

[BibT_eX]

[DOI]

Proceedings of the VISAPP 2015, 2015

Comparison of Watermarking Schemes Using Linear and Nonlinear Feature Matching.

[BibT_eX]

[DOI]

Proceedings of the 2015 Seventh International Conference on Knowledge and Systems Engineering, 2015

Completeness of Single-Bit Projection-KDM Security for Public Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology, 2015

Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Continuous Leakage Resiliency.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014

Randomness Leakage in the KEM/DEM Framework.

[BibT_eX]

[DOI]

Hitoshi Namiki

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Leakage Resiliency.

[BibT_eX]

[DOI]

Proceedings of the Provable Security - 8th International Conference, 2014

A proposal of novel q-DWT for blind and robust image watermarking.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE Annual International Symposium on Personal, 2014

Efficient Key Dependent Message Security Amplification Against Chosen Ciphertext Attacks.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2014, 2014

2013

Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees.

[BibT_eX]

[DOI]

Tatsuya Akutsu

Daiji Fukagawa

Magnús M. Halldórsson

Atsuhiro Takasu

Theor. Comput. Sci., 2013

Leakage-Resilience of Stateless/Stateful Public-Key Encryption from Hash Proofs.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013

Grey-Box Public-Key Steganography.

[BibT_eX]

[DOI]

Hirotoshi Takebe

Proceedings of the Theory and Applications of Models of Computation, 2013

Factoring-Based Proxy Re-Encryption Schemes.

[BibT_eX]

[DOI]

Proceedings of the Provable Security - 7th International Conference, 2013

Attacks to the Proxy Re-Encryption Schemes from IWSEC2011.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2013

Game-Theoretic Security for Bit Commitment.

[BibT_eX]

[DOI]

Haruna Higo

Proceedings of the Advances in Information and Computer Security, 2013

A 3D vision 2.1Mpixel image sensor for single-lens camera systems.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Solid-State Circuits Conference, 2013

Proxy Re-Encryption in a Stronger Security Model Extended from CT-RSA2012.

[BibT_eX]

[DOI]

Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012

A Multi-Trapdoor Commitment Scheme from the RSA Assumption.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

An Efficient Non-interactive Universally Composable String-Commitment Scheme.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Reduction-Centric Non-programmable Security Proof for the Full Domain Hash in the Random Oracle Model.

[BibT_eX]

[DOI]

Proceedings of the Information Security Applications - 13th International Workshop, 2012

Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability.

[BibT_eX]

[DOI]

Hirotoshi Takebe

Proceedings of the Advances in Information and Computer Security, 2012

A Game-Theoretic Perspective on Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012

2011

Programmability in the Generic Ring and Group Models.

[BibT_eX]

[DOI]

J. Internet Serv. Inf. Secur., 2011

Information-Theoretic Secrecy with Access to Decryption Oracles.

[BibT_eX]

[DOI]

Christopher Portmann

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity.

[BibT_eX]

[DOI]

Christopher Portmann

IACR Cryptol. ePrint Arch., 2011

Weak Oblivious Transfer from Strong One-Way Functions.

[BibT_eX]

[DOI]

Akihiro Yamada

Proceedings of the Provable Security - 5th International Conference, 2011

2010

A Rational Secret-Sharing Scheme Based on RSA-OAEP.

[BibT_eX]

[DOI]

Koichiro Wada

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Key Generation for Fast Inversion of the Paillier Encryption Function.

[BibT_eX]

[DOI]

Takato Hirano

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Security of Encryption Schemes in Weakened Random Oracle Models.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.

[BibT_eX]

[DOI]

Toshihide Matsuda

Proceedings of the Public Key Cryptography, 2010

2009

Symmetricity of the Protocols Related to Oblivious Transfer.

[BibT_eX]

[DOI]

Daisuke Inoue

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Primitive Power Roots of Unity and Its Application to Encryption.

[BibT_eX]

[DOI]

Takato Hirano

Koichiro Wada

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009

Efficient Public Key Encryption Based on Ideal Lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge.

[BibT_eX]

[DOI]

Keita Xagawa

Proceedings of the Provable Security, Third International Conference, 2009

Efficient Non-interactive Universally Composable String-Commitment Schemes.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, Third International Conference, 2009

On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Provable Security, Third International Conference, 2009

On the Weak Ideal Compression Functions.

[BibT_eX]

[DOI]

Akira Numayama

Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

Security on Hybrid Encryption with the Tag-KEM/DEM Framework.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

Multi-recipient Public-Key Encryption from Simulators in Security Proofs.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 14th Australasian Conference, 2009

2008

Conditional Converge Cast.

[BibT_eX]

[DOI]

Daisuke Inoue

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2008

Security of Digital Signature Schemes in Weakened Random Oracle Models.

[BibT_eX]

[DOI]

Akira Numayama

Proceedings of the Public Key Cryptography, 2008

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.

[BibT_eX]

[DOI]

Keita Xagawa

Proceedings of the Advances in Cryptology, 2008

Public-Key Cryptosystems with Primitive Power Roots of Unity.

[BibT_eX]

[DOI]

Takato Hirano

Koichiro Wada

Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007

The IllusionHole for Medical Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE Virtual Reality Conference, 2007

Multi-bit Cryptosystems Based on Lattice Problems.

[BibT_eX]

[DOI]

Keita Xagawa

Proceedings of the Public Key Cryptography, 2007

Anonymity on Paillier's Trap-Door Permutation.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007

2006

A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem.

[BibT_eX]

[DOI]

Harunaga Hiwatari

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Schemes for Encryption with Anonymity and Ring Signature.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Secret Handshake with Multiple Groups.

[BibT_eX]

[DOI]

Naoyuki Yamashita

Proceedings of the Information Security Applications, 7th International Workshop, 2006

PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 11th Australasian Conference, 2006

2005

Shufle for Paillier's Encryption Scheme.

[BibT_eX]

[DOI]

Takao Onodera

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2005

Universal Designated-Verifier Signature with Aggregation.

[BibT_eX]

[DOI]

Akihiro Mihara

Proceedings of the Third International Conference on Information Technology and Applications (ICITA 2005), 2005

Security for Authenticated Key Exchange Based on Non-Malleability.

[BibT_eX]

[DOI]

Hiroki Hada

Proceedings of the Third International Conference on Information Technology and Applications (ICITA 2005), 2005

Universally Anonymizable Public-Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

An (n-t)-out-of-n Threshold Ring Signature Scheme.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004

Limiting negations in bounded-depth circuits: An extension of Markov's theorem.

[BibT_eX]

[DOI]

Shao Chin Sung

Inf. Process. Lett., 2004

An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications.

[BibT_eX]

[DOI]

Tatsuaki Okamoto

Proceedings of the Public Key Cryptography, 2004

2003

Quantum Bit-commitment for Small Storage Based on Quantum One-way Permutations.

[BibT_eX]

[DOI]

New Gener. Comput., 2003

Extended Hierarchical Task Network Planning for Interactive Comedy.

[BibT_eX]

[DOI]

Ruck Thawonmas

Hiroki Hassaku

Proceedings of the Intelligent Agents and Multi-Agent Systems, 2003

Mimicry: Another Approach for Interactive Comedy.

[BibT_eX]

Ruck Thawonmas

Hiroki Hassaku

Proceedings of the 4th International Conference on Intelligent Games and Simulation (GAME-ON 2003), 2003

2002

An exponential gap with the removal of one negation gate.

[BibT_eX]

[DOI]

Shao Chin Sung

Inf. Process. Lett., 2002

2000

Quantum Public-Key Cryptosystems.

[BibT_eX]

[DOI]

Tatsuaki Okamoto

Shigenori Uchiyama

Proceedings of the Advances in Cryptology, 2000

1999

Minimizing maximum absolute lateness and range of lateness under generalizeddue dates on a single machine.

[BibT_eX]

[DOI]

Milan Vlach

Ann. Oper. Res., 1999

1998

On the Complexity of Negation-Limited Boolean Networks.

[BibT_eX]

[DOI]

Robert Beals

SIAM J. Comput., 1998

1996

Negation-Limited Circuit Complexity of Symmetric Functions.

[BibT_eX]

[DOI]

Robert Beals

Inf. Process. Lett., 1996

Approximation and Special Cases of Common Subtrees and Editing Distance.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

1995

On the Negation-Limited Circuit Complexity of Clique Functions.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 1995

More on the complexity of negation-limited circuits.

[BibT_eX]

[DOI]

Robert Beals

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994

On the complexity of negation-limited Boolean networks.

[BibT_eX]

[DOI]