Journal of Applied and Industrial Mathematics
ISSN 1990-4789 (Print)
ISSN 1990-4797 (Online)
Menu
Archives
Home
About the Journal
Editorial Team
Editorial Policies
Author Guidelines
About the Journal
Issues
Search
Current
Archives
Contact
All Journals
User
Username
Password
Remember me
Forgot password?
Register
Notifications
View
Subscribe
Search
Search
Search Scope
All
Authors
Title
Abstract
Index terms
Full Text
Browse
By Issue
By Author
By Title
By Sections
Other Journals
Subscription
Login to verify subscription
Keywords
Boolean function
Cauchy problem
Euclidean space
approximation algorithm
bilevel programming
boundary value problem
complexity
computational complexity
crack
finite element method
graph
independent set
inverse problem
labeled graph
nonpenetration condition
phase portrait
plate
rigid body
stability
thin rigid inclusion
variational inequality
Information
For Readers
For Authors
For Librarians
×
User
Username
Password
Remember me
Forgot password?
Register
Notifications
View
Subscribe
Search
Search
Search Scope
All
Authors
Title
Abstract
Index terms
Full Text
Browse
By Issue
By Author
By Title
By Sections
Other Journals
Subscription
Login to verify subscription
Keywords
Boolean function
Cauchy problem
Euclidean space
approximation algorithm
bilevel programming
boundary value problem
complexity
computational complexity
crack
finite element method
graph
independent set
inverse problem
labeled graph
nonpenetration condition
phase portrait
plate
rigid body
stability
thin rigid inclusion
variational inequality
Information
For Readers
For Authors
For Librarians
Home
>
Search
>
Author Details
Author Details
Popkov, K.
Issue
Section
Title
File
Vol 11, No 3 (2017)
Article
On the exact value of the length of the minimal single diagnostic test for a particular class of circuits
Vol 12, No 2 (2018)
Article
Complete Fault Detection Tests of Length 2 for Logic Networks under Stuck-at Faults of Gates
Vol 13, No 1 (2019)
Article
Short Complete Fault Detection Tests for Logic Networks with Fan-In Two
This website uses cookies
You consent to our cookies if you continue to use our website.
About Cookies
TOP